Problem D
Birthday Candles

Minka the Martian is celebrating their birthday with many friends. Similar to Earth birthdays, the occasion is commemorated by blowing candles out on a cake. However, on Mars the candles are placed on the cake differently: each of the $N$ guests attending the party will place $H$ candles on the cake representing the number of hours the Martian has been alive. So the cake will have exactly $N \cdot H$ candles in total. Even more surprising is that each guest hand-crafted the $H$ candles that they placed on the cake, so the candles are not necessarily identical.

Minka is not feeling particularly well today and fears they won’t be able to blow out all candles. Each candle takes a certain effort to blow out, the effort is given as a positive integer. Minka has a capacity $C$ to blow out candles, which may not be enough to blow out all candles.

There is one further complication. Minka wants does not want any guest to feel neglected. When they finish blowing out candles, the number of remaining candles between any two guests should differ by at most one. That is, if for each guest $i$ we let $r_ i$ denote the number of their candles remaining after Minka blows some out, then it should be that $|r_ i - r_ j| \leq 1$ for any two guests $i$ and $j$.

Determining the maximum number of candles that Minka can blow out such that the total capacity of all extinguished candles is at most $C$ and such that $|r_ i - r_ j| \leq 1$ for any two guests $i$ and $j$.

Input

The first line of input contains three integers $N$ ($1 \leq N \leq 100$), $H$ ($1 \leq H \leq 1\, 000$), and $C$ ($1 \leq C \leq 10^9$).

The next $N$ lines describe the candles brought by the guests. The $i$’th such line contains $H$ integers indicating the effort to blow out each of the $H$ candles brought by guest $i$. Each of these values is given as a positive integer at most $10^9$.

Output

Output a single line indicating the maximum number of candles that Minka can blow out subject to the restrictions mentioned above.

2 3 6
1 2 1
3 2 1

4

4 3 30
7 4 5
3 2 4
5 1 2
1 2 6

10

2 3 3
1 1 1
4 5 7

1