n, m, k = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(n)]
inf = 10 ** 9
if k >= n + m - 1:
  print(inf)
  exit()
dp = [[[0] * (k + 1) for _ in range(m)] for _ in range(n)]
dp[0][0][0] = a[0][0]
for i in range(n):
  for j in range(m):
    for l in range(k):
      if l + 1 > i + j:
        dp[i][j][l+1] = inf
      if i:
        dp[i][j][l+1] = max(dp[i][j][l+1], dp[i-1][j][l])
        dp[i][j][l] = max(dp[i][j][l], min(dp[i-1][j][l], a[i][j]))
      if j:
        dp[i][j][l+1] = max(dp[i][j][l+1], dp[i][j-1][l])
        dp[i][j][l] = max(dp[i][j][l], min(dp[i][j-1][l], a[i][j]))
    if i:
      dp[i][j][k] = max(dp[i][j][k], min(dp[i-1][j][k], a[i][j]))
    if j:
      dp[i][j][k] = max(dp[i][j][k], min(dp[i][j-1][k], a[i][j]))
print(max(dp[-1][-1]))

# print(*dp, sep = "\n")

# for dpi in dp:
#   print(*dpi, sep = "\n")
#   print()