#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

int main()
{
    int n, m, k;
    cin >> n >> m >> k;
    vector<vector<int>> a(n, vector<int>(m));
    rep(i,n)rep(j,m) cin >> a[i][j];
    ll low = 0;
    ll high = 2e9;
    vector<int> dx = {1, 0, -1, 0};
    vector<int> dy = {0, 1, 0, -1};
    while(high-low>1) {
        ll mid = (high+low)/2;
        vector<vector<ll>> dp(n+1, vector<ll>(m+1, n+m));
        if(a[0][0]<mid) dp[0][0] = 1;
        else dp[0][0] = 0;
        deque<P> q;
        q.emplace_back(0, 0);
        while(!q.empty()) {
            auto [x, y] = q.front();q.pop_front();
            rep(d, 4) {
                int nx = x + dx[d];
                int ny = y + dy[d];
                if(nx<0 || nx>=n || ny<0 || ny>=m) continue;
                if(a[nx][ny]<mid) {
                    if(dp[nx][ny]>dp[x][y]+1) {
                        q.emplace_back(nx,ny);
                        dp[nx][ny] = dp[x][y] + 1;
                    }
                }
                else{
                    if(dp[nx][ny]>dp[x][y]) {
                        q.emplace_front(nx, ny);
                        dp[nx][ny] = dp[x][y];
                    }
                }
           }           
        }
        if(dp[n-1][m-1]<=k) low = mid;
        else high = mid; 
    }
    cout << min(low, (ll)1e9) << endl;
    return 0;
}