import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
n,m,k = na()
a = [na() for i in range(n)]

ok = 0
ng = 10 ** 9 + 1
from collections import deque
while (ng - ok) > 1:
    mid = (ok + ng) // 2
    dp = [[10 ** 18] * m for i in range(n)]
    if a[0][0] >= mid:
        dq = deque([(0, 0, 0)])
        dp[0][0] = 0
    else:
        dq = deque([(1, 0, 0)])
        dp[0][0] = 1
    while dq:
        c, x, y = dq.pop()
        if dp[x][y] < c:
            continue
        for dx, dy in [(1, 0), (0, 1), (-1, 0), (0, -1)]:
            nx, ny = x + dx, y + dy
            if 0 <= nx < n and 0 <= ny < m:
                if a[nx][ny] < mid:
                    nc = c + 1
                    if dp[nx][ny] > nc:
                        dp[nx][ny] = nc
                        dq.append((nc, nx, ny))
                else:
                    nc = c
                    if dp[nx][ny] > nc:
                        dp[nx][ny] = nc
                        dq.appendleft((nc, nx, ny))


    if dp[n - 1][m - 1] <= k:
        ok = mid
    else:
        ng = mid

print(ok)