#include <bits/stdc++.h>

using namespace std;

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

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    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 ok = 1, ng = 1000000000 + 1;
    while(abs(ok - ng) > 1){
        int mid = (ok + ng) / 2;

        vector<vector<int>> b(n, vector<int>(m));
        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                if(a[i][j] < mid){
                    b[i][j] = 1;
                }else{
                    b[i][j] = 0;
                }
            }
        }

        vector<vector<int>> cost(n, vector<int>(m, -1));
        deque<tuple<int, int, int>> deq;
        deq.emplace_back(b[0][0], 0, 0);
        while(deq.size()){
            auto [dist, x, y] = deq.front();
            deq.pop_front();
            if(cost[x][y] != -1){
                continue;
            }
            cost[x][y] = dist;
            for(int dir = 0; dir < 4; dir++){
                int nx = x + dx[dir], ny = y + dy[dir];
                if(0 <= nx && nx < n && 0 <= ny && ny < m){
                    if(b[nx][ny] == 0){
                        deq.emplace_front(dist, nx, ny);
                    }else{
                        deq.emplace_back(dist + 1, nx, ny);
                    }
                }
            }
        }

        if(cost[n - 1][m - 1] <= k){
            ok = mid;
        }else{
            ng = mid;
        }
    }
    cout << ok << endl;
}