#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
template <class T, class F>
T binarySearch(T ok, T ng, const F &f) {
	while (abs(ok - ng) > 1) {
		T mid = (ok + ng) / 2;
		(f(mid) ? ok : ng) = mid;
	}
	return ok;
}
const int dx[4] = { 1,0,-1,0 };
const int dy[4] = { 0,-1,0,1 };
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m, k; cin >> n >> m >> k;
	vector a(n, vector<int>(m));
	rep(i, n)rep(j, m)cin >> a[i][j];
	auto f = [&](long long tar)->bool {
		vector dp(n, vector<int>(m, INF));
		dp[0][0] = a[0][0] < tar;
		deque<P>que;
		que.push_back({ 0,0 });
		while (!que.empty()) {
			auto[x, y] = que.front();
			que.pop_front();
			rep(i, 4) {
				int nx = x + dx[i];
				int ny = y + dy[i];
				if (nx < 0 || nx >= n)continue;
				if (ny < 0 || ny >= m)continue;
				if (a[nx][ny] < tar) {
					if (chmin(dp[nx][ny], dp[x][y] + 1)) {
						que.push_back({ nx,ny });
					}
				}
				else {
					if (chmin(dp[nx][ny], dp[x][y] + 0)) {
						que.push_front({ nx,ny });
					}
				}

			}
		}
		return dp[n - 1][m - 1] <= k;
	};
	auto ans = binarySearch(1, INF + 1, f);
	cout << ans << endl;
	return 0;
}