from collections import deque
N,M,K = map(int,input().split())
A = [list(map(int,input().split())) for _ in range(N)]
high = 10**9+10
low = 0
while high-low>1:
    mid = (high+low)//2
    dist = [[-1 for _ in range(M)] for _ in range(N)]
    if A[0][0]>=mid:
        dist[0][0] = 0
    else:
        dist[0][0] = 1
    que = deque([[0,0]])
    while que:
        i,j = que.popleft()
        for di,dj in [(0,1),(1,0),(0,-1),(-1,0)]:
            ni,nj = i+di,j+dj
            if 0<=ni<N and 0<=nj<M and dist[ni][nj]==-1:
                if A[ni][nj]>=mid:
                    dist[ni][nj] = dist[i][j]
                    que.appendleft([ni,nj])
                else:
                    dist[ni][nj] = dist[i][j]+1
                    que.append([ni,nj])
    if dist[N-1][M-1]<=K:
        low = mid
    else:
        high = mid
print(min(low,10**9))