#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

int main() {
    ll N, M, K;
    cin >> N >> M >> K;
    vector<vector<ll>> A(N, vector<ll>(M));
    for (ll i = 0; i < N; i++) {
        for (ll j = 0; j < M; j++) {
            cin >> A[i][j];
        }
    }

    vector<ll> dx = {1, 0, -1, 0};
    vector<ll> dy = {0, 1, 0, -1};
    ll INF = N * M + 1;
    ll ok = 1;
    ll ng = 1000000001;
    while (ng - ok > 1) {
        ll mid = (ok + ng) / 2;
        deque<pll> que;
        que.push_back(pll(0, 0));
        vector<vector<ll>> dist(N, vector<ll>(M, INF));
        vector<vector<bool>> visited(N, vector<bool>(M, false));
        dist[0][0] = 1;
        if (A[0][0] >= mid) {
            dist[0][0] = 0;
        }
        while (que.size()) {
            pll p = que.front();
            ll px = p.first;
            ll py = p.second;
            que.pop_front();
            if (visited[px][py]) {
                continue;
            }
            visited[px][py] = true;
            for (ll k = 0; k < 4; k++) {
                if (px + dx[k] >= 0 && px + dx[k] < N && py + dy[k] >= 0 &&
                    py + dy[k] < M) {
                    if (visited[px + dx[k]][py + dy[k]]) {
                        continue;
                    }
                    if (A[px + dx[k]][py + dy[k]] >= mid) {
                        que.push_front(pll(px + dx[k], py + dy[k]));
                        dist[px + dx[k]][py + dy[k]] =
                            min(dist[px + dx[k]][py + dy[k]], dist[px][py]);
                    } else {
                        que.push_back(pll(px + dx[k], py + dy[k]));
                        dist[px + dx[k]][py + dy[k]] =
                            min(dist[px + dx[k]][py + dy[k]], dist[px][py] + 1);
                    }
                }
            }
        }
        if (dist[N - 1][M - 1] > K) {
            ng = mid;
        } else {
            ok = mid;
        }
    }
    cout << ok << endl;
}