#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(),(v).end()
#define pb(a) push_back(a)
#define rep(i, n) for(int i=0;i<n;i++)
#define foa(e, v) for(auto& e : v)
using ll = long long;
const ll MOD7 = 1000000007, MOD998 = 998244353, INF = (1LL << 60);
#define dout(a) cout<<fixed<<setprecision(10)<<a<<endl;

void chmax(ll &a, ll b) { a = max(a, b); }
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n, m, k;
    cin >> n >> m >> k;
    int dy[4] = {-1, 0, 0, 1};
    int dx[4] = {0, -1, 1, 0};
    vector a(n, vector(m, 0LL));
    rep(i, n) rep(j, m) cin >> a[i][j];
    ll le = 0, ri = 1000000001;
    while(ri - le > 1) {
        ll mid = (ri + le) / 2;
        vector b(n, vector(m, 0));
        rep(i, n) rep(j, m) if(a[i][j] >= mid) b[i][j] = 1;
        vector dis(n, vector(m, 1 << 30));
        deque<pair<int, int>> dq;
        if(b[0][0]) dis[0][0] = 0;
        else dis[0][0] = 1;
        dq.push_back({0, 0});
        while(!dq.empty()) {
            auto [i, j] = dq.front();
            dq.pop_front();
            rep(kk, 4) {
                int y = i + dy[kk];
                int x = j + dx[kk];
                if(y < 0 or y >= n or x < 0 or x >= m) continue;
                if(b[y][x]) {
                    if(dis[y][x] > dis[i][j]) {
                        dis[y][x] = dis[i][j];
                        dq.push_front({y, x});
                    }
                } else {
                    if(dis[y][x] > dis[i][j] + 1) {
                        dis[y][x] = dis[i][j] + 1;
                        dq.push_back({y, x});
                    }
                }
            }
        }
        if(dis[n - 1][m - 1] <= k) le = mid;
        else ri = mid;
    }
    cout << le << endl;
    return 0;
}