#include<bits/stdc++.h>
using namespace std;
int H,W,K,A[303][303];
int dist[303][303],B[303][303];
int dr[4]={1,0,-1,0},dc[4]={0,1,0,-1};
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>H>>W>>K;
    for(int i=1;i<=H;i++)for(int j=1;j<=W;j++)cin>>A[i][j];
    int L=0,R=int(1e9)+1;
    while(R-L>1)
    {
        int mid=(L+R)/2;
        for(int i=1;i<=H;i++)for(int j=1;j<=W;j++)
        {
            B[i][j]=A[i][j]<mid;
            dist[i][j]=1<<30;
        }
        dist[1][1]=B[1][1];
        deque<pair<int,int>>q;
        q.push_back(make_pair(1,1));
        while(q.size())
        {
            auto[r,c]=q.front();
            q.pop_front();
            for(int d=0;d<4;d++)
            {
                int tr=r+dr[d],tc=c+dc[d];
                if(1<=tr&&tr<=H&&1<=tc&&tc<=W)
                {
                    if(B[tr][tc]==1)
                    {
                        if(dist[tr][tc]>dist[r][c]+1)
                        {
                            dist[tr][tc]=dist[r][c]+1;
                            q.push_back(make_pair(tr,tc));
                        }
                    }
                    else
                    {
                        if(dist[tr][tc]>dist[r][c])
                        {
                            dist[tr][tc]=dist[r][c];
                            q.push_front(make_pair(tr,tc));
                        }
                    }
                }
            }
        }
        if(dist[H][W]<=K)L=mid;
        else R=mid;
    }
    cout<<L<<endl;
}