#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <cassert>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
//using mint = modint1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repu(i, s, t) for (int i = (int)(s); i < (int)(t); i++)
#define repd(i, s, t) for (int i = (int)(s)-1; i >= (int)(t); i--)
#define all(v) v.begin(), v.end()
void _u() { cerr << endl; } template <class H, class... T> void _u(H&& h, T&&... t) { cerr << h << ", "; _u(move(t)...); }
#define U(...) { cerr << #__VA_ARGS__ << ": "; _u(__VA_ARGS__); }
template<typename T> bool chmax(T &a, const T b) { if(a >= b) return false; a = b; return true; }
template<typename T> bool chmin(T &a, const T b) { if(a <= b) return false; a = b; return true; }
template<typename T> istream& operator>>(istream &in, vector<T> &a) { for(T &x: a) in >> x; return in; }
template<typename T> ostream& operator<<(ostream &out, const vector<T> &a) { for(const T &x: a) out << x << ' '; return out; }
const int di[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dj[] = {0, 1, 0, -1, -1, 1, 1, -1, 0};


int main() {
    int n, m, k;
    cin >> n >> m >> k;
    vector<vector<int>> a(n, vector<int>(m));
    cin >> a;
    const int INF = 1e9;
    int ok = 0, ng = 1000000001;
    while(ok < ng-1) {
        int mid = (ok+ng) / 2;
        vector<vector<int>> dist(n, vector<int>(m, INF));
        deque<pair<int, int>> wait;
        if(a[0][0] < mid) dist[0][0] = 1;
        else dist[0][0] = 0;
        wait.emplace_back(0, 0);
        while(!wait.empty()) {
            auto[pi, pj] = wait.front(); wait.pop_front();
            rep(k, 4) {
                int ni = pi + di[k];
                int nj = pj + dj[k];
                if(ni < 0 || ni >= n || nj < 0 || nj >= m) continue;
                int nd = dist[pi][pj] + int(a[ni][nj] < mid);
                if(dist[ni][nj] <= nd) continue;
                dist[ni][nj] = nd;
                if(a[ni][nj] >= mid) wait.emplace_front(ni, nj);
                else wait.emplace_back(ni, nj);
            }
        }
        if(dist[n-1][m-1] <= k) ok = mid;
        else ng = mid;
    }
    cout << ok << endl;
    return 0;
}