from collections import deque
import sys
input = sys.stdin.readline
N, M, K = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(N)]
if N+M-1<=K:
    print(10**9)
    exit()
B = [[0 for _ in range(M)] for _ in range(N)]
l = 0
r = 10**9+1
while r-l>1:
    mid = (l+r)//2
    for i in range(N):
        for j in range(M):
            B[i][j] = 1 if A[i][j]<mid else 0
    deq = deque()
    deq.append((0, 0))
    INF = 10**9
    dist = [[INF for _ in range(M)] for _ in range(N)]
    dist[0][0] = B[0][0]
    dir = [(0, 1), (1, 0), (0, -1), (-1, 0)]
    while deq:
        i, j = deq.popleft()
        for di, dj in dir:
            ni = i+di
            nj = j+dj
            if 0<=ni<N and 0<=nj<M:
                if dist[ni][nj]>dist[i][j]+B[ni][nj]:
                    dist[ni][nj] = dist[i][j]+B[ni][nj]
                    if B[ni][nj]==0:
                        deq.appendleft((ni, nj))
                    else:
                        deq.append((ni, nj))
    if dist[N-1][M-1]<=K:
        l = mid
    else:
        r = mid
print(l)