#include <cassert>
#include <deque>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;

int main() {
    int n, m, k;
    cin >> n >> m >> k;
    vector a(n, vector<int>(m));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cin >> a[i][j];
        }
    }

    assert(2 <= n && n <= 500);
    assert(2 <= m && m <= 500);
    assert(0 <= k && k <= n * m);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            assert(1 <= a[i][j] && a[i][j] <= 1000000000);
        }
    }

    int l = 0, r = 1000000001;
    while (r - l > 1) {
        int mid = (l + r) / 2;

        deque<tuple<int, int, int>> que;
        vector cost(n, vector<int>(m, -1));

        const int dx[] = {1, 0, -1, 0};
        const int dy[] = {0, 1, 0, -1};

        que.emplace_back(0, 0, (a[0][0] < mid ? 1 : 0));
        while (que.size()) {
            auto [x, y, c] = que.front();
            que.pop_front();
            if (cost[y][x] != -1) {
                continue;
            }
            cost[y][x] = c;
            for (int i = 0; i < 4; ++i) {
                int nx = x + dx[i];
                int ny = y + dy[i];
                if (nx < 0 || nx >= m || ny < 0 || ny >= n) {
                    continue;
                }
                if (cost[ny][nx] != -1) {
                    continue;
                }
                if (a[ny][nx] < mid) {
                    que.emplace_back(nx, ny, c + 1);
                } else {
                    que.emplace_front(nx, ny, c);
                }
            }
        }

        if (cost[n - 1][m - 1] <= k) {
            l = mid;
        } else {
            r = mid;
        }
    }
    cout << l << endl;
    return 0;
}