from collections import*

n, m, k = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(n)]

ng = 10 ** 9 + 1
ok = 0
while abs(ok - ng) > 1:
    mid = (ok + ng) // 2
    # begin mid が ok かどうか判定する為の前処理
    dp = [[-1] * m for _ in range(n)]
    dp[0][0] = int(a[0][0] < mid)
    q = deque([(0, 0)])
    while q:
        i, j = q.popleft()
        for x, y in [(i - 1, j), (i, j - 1), (i, j + 1), (i + 1, j)]:
            if 0 <= x < n and 0 <= y < m and dp[x][y] == -1:
                if a[x][y] < mid:
                    dp[x][y] = dp[i][j] + 1
                    q.append((x, y))
                else:
                    dp[x][y] = dp[i][j]
                    q.appendleft((x, y))
    # end mid が ok かどうか判定する為の前処理
    if dp[-1][-1] <= k: # mid が ok の場合の条件
        ok = mid
    else:
        ng = mid
print(ok)