# 2871. The Triangle

For her spectacular milk output for the previous month, Farmer John has awarded Bessie a prize – with a twist. He has given her a triangular grid with $N$ ($1 \le N \le 700$) rows (whose lengths vary from $1$ through $N$, of course). Row $i$ of the the grid has i values labeled $v_{ij}$ ($-10^9 \le v_{ij} \le 10^9$) where $j$ is in the range $1..i$.

Bessie chooses a sub-triangle whose side length is at least $K$ ($1 \le K \le 20; 1 \le K \le N$) within the triangular grid. The sub-triangle is another triangular grid which might be oriented the same as the original triangle or might be “upside down” with its shorter rows on the bottom instead of the top.

After she chooses her sub-triangle, Farmer John will take the average of all the numbers in the sub-triangle, discarding the digits to the right of the decimal point, and give her that many gold coins (or take that many gold coins from her if the number is negative). Naturally, Bessie would like to maximize her prize (or minimize her loss). Help her solve this problem.

By way of example, Bessie is given this triangular grid with $N = 3$ rows and must choose a sub-triangle with a side length of at least $K = 2$. A graphical representation of the triangle is shown below:

   / \
/ 5 \
/-8  4\
/2 -3  6\
---------


She could choose any of five valid sub-triangles (one of which is
the entire original triangle):

   / \         / \        / \         / \        /5 \
/ 5 \       / \5\      / 5 \       / 5/\      /----\
/-8  4\     /-8 \4\    /-8  4\     /-8/ 4\    /\-8 4/\
/2 -3  6\   / 2 -3\6\  /-------\   / 2/-3 6\  / 2\-3/6 \
---------   ---------  -2  -3  6   ---------  ----------
entire      lower        top          lower     upside
triangle     left                      right      down


The one that is lined below is the one with the highest average:

   / \
/ 5/\
/-8/ 4\
/ 2/-3 6\
---------


The average of this sub-triangle is $(4+6-3)/3$, which is about $2.3333…$; without the fraction, the answer is $2$.

Help Bessie calculate the maximum amount of coins which she could receive.

### 输入格式

• Line 1: Two space-separated integers: $N$ and $K$

• Lines 2..N+1: Line $i+1$ will contain $i$ space-separated integers: $v_{ij}$

### 输出格式

• Line 1: The maximum number of coins that Bessie can receive (or, if negative, the best she can do for her loss).

### 样例

Input
3 2
5
-8 4
2 -3 6

Output
2


2 人解决，5 人已尝试。

2 份提交通过，共有 24 份提交。

9.4 EMB 奖励。