20747번 - Fishing Contest 다국어

문제

In a fishing contest, the participants fish in a lake, represented as a 2D grid of dimension $r \times c$. Each integer point in the grid contains fish.

At point $(x, y),ドル fish first appear at second $t_{x, y}$ and disappear just before time $t_{x, y} + k$ seconds. Outside of this time, no fish can be caught at this position. It takes no time to catch all the fish at a point, and all points contain the same amount of fish. Furthermore, moving to the point immediately north, west, south or east from the point you are currently at takes exactly 1ドル$ second.

Assume that you start at some position $(x_0, y_0)$ at second 1ドル,ドル and can catch fish until (and including) second $l$. From how many points in the lake can you catch fish, if you travel optimally on the lake?

입력

The input consists of:

• one line with the integers $r,ドル $c,ドル $k$ and $l$ (1ドル \le r, c \le 100,ドル 1ドル \le k \le 5,ドル 1ドル \le l \le 10^5$), the dimensions of the lake, the number of seconds fish stays at a point, and the number of seconds you can catch fish.
• one line with the integers $x_0$ and $y_0$ (0ドル \le r < x_0,ドル 0ドル \le c < y_0$), your original position.
• $r$ lines, the $x$'th of which contains $c$ integers $t_{x, 0}, \dots, t_{x, c - 1}$ (each between 1ドル$ and $l,ドル inclusive), the times at which fish appers on points in the $x$'th row.

출력

Output the maximum number of points you could catch fish from.

제한

힌트