N, M, K = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(N)]

def func(n):
    dp = [[0]*M for _ in range(N)]
    if A[0][0] < n:
        dp[0][0] = 1
    for i in range(N):
        for j in range(M):
            if i == 0 and j == 0:
                continue
            if i == 0:
                dp[i][j] = dp[i][j-1]+(A[i][j] < n)
            elif j == 0:
                dp[i][j] = dp[i-1][j]+(A[i][j] < n)
            else:
                dp[i][j] = min(dp[i][j-1], dp[i-1][j])+(A[i][j] < n)
    return dp[-1][-1]

left = 1
right = 10**9+1
while left+1 < right:
    mid = (left+right)//2
    if func(mid) <= K:
        left = mid
    else:
        right = mid

print(left)