Problem: F --Land inheritance

Problem Statement

One $ N $ brother was discussing the inheritance of his parents. The vast heritage left by their parents included vast lands. The land has a rectangular shape extending $ H $ km from north to south and $ W $ km from east to west. This land is managed in units of 1 km square, 1 km square within the range of $ i $ to $ i + 1 $ km from the north end of the land and $ j $ to $ j + 1 $ km from the west end. The partition is called partition $ (i, j) $. ($ i $, $ j $ is an integer that satisfies $ 0 \ leq i <H $, $ 0 \ leq j <W $.) The land price is fixed for each lot, and the lot $ (i, j) $ The price of is represented by $ a_ {i, j} $.

The brothers decided to divide the land and inherit it as follows.

* $ N $ Each of the siblings chooses some parcels and inherits them.
* The parcels must be chosen so that the land inherited by each sibling forms a rectangle.
* $ N $ Lands inherited by brothers must not overlap.
* There may be compartments where no one inherits. The parcels that no one inherits are abandoned.



The sum of the prices of the lots included in the range of land inherited by a person is called the price of the land. The brothers want to divide the land so that the price of the land they inherit is as fair as possible. Your job is to think of ways to divide the land that maximizes the price of the land of the person with the lowest inherited land price among the $ N $ people. Create a program that answers the land price of the person with the lowest inherited land price when the land is divided in this way.

Input

The input is given in the following format.

$ H $ $ W $ $ N $
$ a_ {0,0} $ $ a_ {0,1} $ ... $ a_ {0, W-1} $
...
$ a_ {H-1,0} $ $ a_ {H-1,1} $ ... $ a_ {H-1, W-1} $

$ H $, $ W $$ (2 \ leq H, W \ leq 200) $ represent the north-south length and the east-west length of the heritage land, respectively. $ N $$ (2 \ leq N \ leq 4) $ represents the number of siblings who inherit the land. $ a_ {i, j} $$ (0 \ leq a_ {i, j} \ leq 10 ^ 4) $ represents the price of the partition $ (i, j) $.

Output

Output the lowest land price in one line when the land price of the person with the lowest inherited land price is divided so as to maximize the land price.

Sample Input 1


3 3 2
1 2 2
3 1 0
0 4 3

Output for the Sample Input 1


7

It is best to divide as shown in the figure.

<image>


Sample Input 2


3 3 2
0 1 0
1 1 1
0 1 0

Output for the Sample Input 2


1

Sample Input 3


2 5 3
8 3 0 5 6
2 5 2 5 2

Output for the Sample Input 3


11

Sample Input 4


3 3 4
3 3 4
3 3 4
3 3 4

Output for the Sample Input 4


7

Sample Input 5


4 4 4
2 2 2 2
2 1 2 1
2 2 2 2
2 1 2 1

Output for the Sample Input 5


7





Example

Input

3 3 2
1 2 2
3 1 0
0 4 3


Output

7

Solution (in PYTHON3):

Solution:
import sys
readline = sys.stdin.readline
write = sys.stdout.write
def rotate(H, W, R0):
    R1 = [[0]*H for i in range(W)]
    for i in range(H):
        for j in range(W):
            R1[W-1-j][i] = R0[i][j]
    return R1
def make(H, W, R0):
    R1 = [[0]*(W+1) for i in range(H+1)]
    for i in range(H):
        c = 0
        for j in range(W):
            c += R0[i][j]
            R1[i+1][j+1] = c + R1[i][j+1]
    return R1

def solve():
    H, W, N = map(int, readline().split())
    S = [list(map(int, readline().split())) for i in range(H)]
    su = sum(map(sum, S))
    ans = 0
    if N == 2:
        T = make(H, W, S)
        for i in range(H+1):
            e = T[i][W]
            ans = max(ans, min(e, su-e))
        for i in range(W+1):
            e = T[H][i]
            ans = max(ans, min(e, su-e))
    elif N == 3:
        for t in range(4):
            T = make(H, W, S)
            for i in range(H+1):
                e0 = T[i][W]
                for j in range(W+1):
                    e1 = T[H][j] - T[i][j]
                    ans = max(ans, min(e0, e1, su - e0 - e1))
            if t < 2:
                for i in range(W+1):
                    e0 = T[H][i]
                    for j in range(i, W+1):
                        e1 = T[H][j]
                        ans = max(ans, min(e0, e1-e0, su-e1))
            S = rotate(H, W, S)
            H, W = W, H
    else:
        for t in range(4):
            T = make(H, W, S)
            for i in range(H+1):
                for j in range(W+1):
                    e0 = T[i][j]
                    if e0 < ans:
                        continue
                    k1 = 0
                    while k1 < H and T[k1][W] - T[k1][j] < e0:
                        k1 += 1
                    k2 = 0
                    while k2 < W and T[H][k2] - T[i][k2] < e0:
                        k2 += 1
                    if i < k1 and j < k2:
                        continue
                    if k1 <= i and k2 <= j:
                        v1 = su - T[H][k2] - T[i][W] + T[i][k2]
                        v2 = su - T[k1][W] - T[H][j] + T[k1][j]
                        if max(v1, v2) >= e0:
                            ans = max(e0, ans)
                    else:
                        v1 = su - T[H][k2] - T[k1][W] + T[k1][k2]
                        if v1 >= e0:
                            ans = max(e0, ans)
            for i in range(W, -1, -1):
                e0 = T[H][i]
                if e0 <= ans:
                    break
                for j in range(i, W+1):
                    e = T[H][j]
                    e1 = e - e0; e2 = su - e
                    if e1 <= ans or e2 <= ans:
                        continue
                    for k in range(j, W+1):
                        f = T[H][k]
                        if su-f <= ans:
                            break
                        ans = max(ans, min(e0, e1, f-e, su-f))
                    for k in range(H+1):
                        f = T[k][j] - T[k][i]
                        if e1-f <= ans:
                            break
                        ans = max(ans, min(e0, f, e1-f, e2))
                    for k in range(H+1):
                        f = T[k][W] - T[k][j]
                        if e2-f <= ans:
                            break
                        ans = max(ans, min(e0, e1, f, e2-f))
                for j in range(H+1):
                    e1 = T[j][W] - T[j][i]
                    e2 = su - e1 - e0
                    if e1 <= ans or e2 <= ans:
                        continue
                    for k in range(i, W+1):
                        f = T[j][k] - T[j][i]
                        if e1-f <= ans:
                            break
                        ans = max(ans, min(e0, f, e1-f, e2))
                    for k in range(i, W+1):
                        f = T[H][k] - e0 - T[j][k] + T[j][i]
                        if e2-f <= ans:
                            break
                        ans = max(ans, min(e0, e1, f, e2-f))
                for j in range(H, -1, -1):
                    e1 = T[j][W] - T[j][i]
                    if su - e0 - e1 <= ans:
                        continue
                    if e1 <= ans:
                        break
                    for k in range(j, H+1):
                        e2 = T[k][W] - T[k][i]
                        if su-e2-e0 <= ans:
                            break
                        ans = max(ans, min(e0, e1, e2-e1, su-e2-e0))
            S = rotate(H, W, S)
            H, W = W, H
    write("%d\n" % ans)
solve()