#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

int main() {
    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];
        }
    }

    const int inf = 1e9;
    int lo = 0, hi = inf + 1;
    while (hi - lo > 1) {
        int mid = (hi + lo) / 2;

        vector<vector<int>> dp(N, vector<int>(M, INF));
        deque<tuple<int, int, int>> dq;
        dp[0][0] = A[0][0] >= mid ? 0 : 1;
        dq.push_back({0, 0, dp[0][0]});

        while (!dq.empty()) {
            auto [x, y, d] = dq.front();
            dq.pop_front();

            if (dp[x][y] < d) continue;

            for (auto [dx, dy] : {pair{0, 1}, {1, 0}, {0, -1}, {-1, 0}}) {
                int nx = x + dx;
                int ny = y + dy;
                if (nx < 0 || nx >= N || ny < 0 || ny >= M) continue;
                int cost = A[nx][ny] >= mid ? 0 : 1;
                if (dp[x][y] + cost >= dp[nx][ny]) continue;
                dp[nx][ny] = dp[x][y] + cost;
                if (cost == 1) {
                    dq.push_back({nx, ny, dp[nx][ny]});
                } else {
                    dq.push_front({nx, ny, dp[nx][ny]});
                }
            }
        }

        if (dp.back().back() > K) {
            hi = mid;
        } else {
            lo = mid;
        }
    }

    cout << lo << endl;
}