#include <bits/stdc++.h>
using namespace std;

void fast_io() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
}

int main() {
	fast_io();
	int n, m, k;
	cin >> n >> m >> k;
	vector<vector<int>> a(n, vector<int>(m));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> a[i][j];
		}
	}
	int dx[] = {1, 0, -1, 0};
	int dy[] = {0, 1, 0, -1};
	auto is_valid = [&](int x, int y) {
		return 0 <= x && x < n && 0 <= y && y < m;
	};
	int ok = 1, ng = 1e9 + 1;
	while (ok + 1 < ng) {
		int mid = (ok + ng) / 2;
		vector<vector<int>> dp(n, vector<int>(m, 1e9));
		vector<vector<bool>> vis(n, vector<bool>(m));
		dp[0][0] = a[0][0] < mid;
		deque<pair<int, int>> dq;
		dq.push_back({0, 0});
		while (!dq.empty()) {
			auto [x, y] = dq.front();
			dq.pop_front();
			if (vis[x][y]) {
				continue;
			}
			vis[x][y] = true;
			for (int i = 0; i < 4; i++) {
				int nx = x + dx[i];
				int ny = y + dy[i];
				if (!is_valid(nx, ny)) {
					continue;
				}
				int cost = (a[nx][ny] < mid);
				if (dp[nx][ny] > dp[x][y] + cost) {
					dp[nx][ny] = dp[x][y] + cost;
					if (cost == 0) {
						dq.push_front({nx, ny});
					} else {
						dq.push_back({nx, ny});
					}
				}
			}
		}
		if (dp[n - 1][m - 1] <= k) {
			ok = mid;
		} else {
			ng = mid;
		}
	}
	cout << ok << endl;
}