# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
from collections import defaultdict as dd
S = input
R = range
P = print
def I(): return int(S())
def M(): return map(int, S().split())
def L(): return list(M())
def O(): return list(map(int, open(0).read().split()))
def yn(b): print("Yes" if b else "No")
biga = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
smaa = "abcdefghijklmnopqrstuvwxyz"
ctoi = lambda c: ord(c) - ord('a')
itoc = lambda i: chr(ord('a') + i)
inf = 10 ** 18
mod = 998244353
def acc(a):
	b = [0]
	for i in a:
		b.append(b[-1] + i)
	return b

x = 10 ** 9

n,m,k = M()
a = [L() for _ in R(n)]
dp = [[[0] * (k + 1) for _ in range(m)] for _ in range(n)]
dp[0][0][0] = a[0][0]
if k > 0:
	dp[0][0][1] = x
for i in R(n):
	for j in R(m):
		if i == 0 and j == 0:
			continue
		if i == 0:
			for p in R(k):
				dp[i][j][p] = max(dp[i][j][p], min(dp[i][j - 1][p], a[i][j]))
				dp[i][j][p + 1] = max(dp[i][j][p + 1], min(dp[i][j - 1][p], x))
			dp[i][j][k] = max(dp[i][j][k], min(dp[i][j - 1][k], a[i][j]))
		elif j == 0:
			for p in R(k):
				dp[i][j][p] = max(dp[i][j][p], min(dp[i - 1][j][p], a[i][j]))
				dp[i][j][p + 1] = max(dp[i][j][p + 1], min(dp[i - 1][j][p], x))
			dp[i][j][k] = max(dp[i][j][k], min(dp[i - 1][j][k], a[i][j]))
		else:
			for p in R(k):
				dp[i][j][p] = max(dp[i][j][p], min(dp[i][j - 1][p], a[i][j]))
				dp[i][j][p + 1] = max(dp[i][j][p + 1], min(dp[i][j - 1][p], x))
			dp[i][j][k] = max(dp[i][j][k], min(dp[i][j - 1][k], a[i][j]))
			for p in R(k):
				dp[i][j][p] = max(dp[i][j][p], min(dp[i - 1][j][p], a[i][j]))
				dp[i][j][p + 1] = max(dp[i][j][p + 1], min(dp[i - 1][j][p], x))
			dp[i][j][k] = max(dp[i][j][k], min(dp[i - 1][j][k], a[i][j]))
print(max(dp[n - 1][m - 1]))