n,m,k=map(int,input().split())
mp=[list(map(int,input().split())) for _ in range(n)]
dist=[[] for _ in range(n+m-1)]
for i in range(n):
	for j in range(m):
		dist[i+j].append(mp[i][j])
ans=[]
for i in range(n+m-1):
	ans.append(max(dist[i]))
ans.sort()
for i in range(k):
	if i>=n+m-1:
		break
	ans[i]=int(1e9)
print(min(ans))