#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(x) x.begin(), x.end()
using namespace std;
using ll=long long;
using ld=long double;
using P=pair<ll,ll>;
#include <atcoder/all>
using namespace atcoder;
//using mint=static_modint<998244353>;
using mint=static_modint<1000000007>;
////using mint=modint;
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")

int inf=2147483647;
ll INF=9223372036854775807;
const ld PI=acos(-1);

void yn(bool f){
	if(f)cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
	return;
}

ll n,m;

bool in(int x,int y){
	if(x<0||n<=x)return false;
	if(y<0||m<=y)return false;
	return true;
}

vector<int> dx={1,-1,0,0};
vector<int> dy={0,0,1,-1};


int main(){
	ll k;cin>>n>>m>>k;
	vector<vector<ll>> a(n,vector<ll>(m));
	rep(i,n)rep(j,m)cin>>a[i][j];

	ll lb=1,ub=1000000000+1;
	priority_queue<pair<int,P>,vector<pair<int,P>>,greater<pair<int,P>>> pq;
	while(lb+1<ub){
		ll md=(lb+ub)/2;
		vector<vector<int>> cos(n,vector<int>(m,-1));

		
		if(a[0][0]<md){
			pq.push({1,{0,0}});
			cos[0][0]=1;
		}
		else{
			pq.push({0,{0,0}});
			cos[0][0]=0;
		}
		while(!pq.empty()){
			auto [c,p]=pq.top();pq.pop();
			auto [x,y]=p;
			rep(i,4){
				int nx=x+dx[i];
				int ny=y+dy[i];
				//cout<<nx<<" "<<ny<<endl;
				if(!in(nx,ny))continue;
				if(cos[nx][ny]!=-1)continue;

				int nc=c;
				if(a[nx][ny]<md)nc++;
				cos[nx][ny]=nc;
				pq.push({nc,{nx,ny}});
			}
		}

		if(cos[n-1][m-1]<=k)lb=md;
		else ub=md;
	}
	cout<<lb<<endl;
}