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


dp = [[-10 ** 18] * M for i in range(N)]
dp[0][0] = A[0][0]

for i in range(N):
  for j in range(M):
    if i > 0:
      dp[i][j] = max(dp[i][j], min(dp[i - 1][j], A[i][j]))
    if j > 0:
      dp[i][j] = max(dp[i][j], min(dp[i][j - 1], A[i][j]))

max_possible = dp[-1][-1]

left, right = max_possible, 10 ** 9

while left < right:
  mid = (left + right + 1) // 2
  change_needed = 0
  dp = [[float('inf')] * M for _ in range(N)]
  dp[0][0] = 0 if A[0][0] >= mid else 1
  
  for i in range(N):
    for j in range(M):
      if i > 0:
        dp[i][j] = min(dp[i][j], dp[i-1][j] + (1 if A[i][j] < mid else 0))
      if j > 0:
        dp[i][j] = min(dp[i][j], dp[i][j-1] + (1 if A[i][j] < mid else 0))

  if dp[-1][-1] <= K:
    left = mid
  else:
    right = mid - 1

print(left)