#include<bits/stdc++.h>

using namespace std;

int r,c,x_s,y_s,e, temp;
int dx[8]   = {-1,  0,  1, 1, 1, 0, -1, -1};
int dy[8]   = {-1, -1, -1, 0, 1, 1,  1,  0};
int cost[8] = {1, 2, 3, 4, 5, 6, 7, 8};
int matriz[505][505];

vector<pair<int, int> > adj[255025];

int main()
{

    cin>>r>>c>>x_s>>y_s>>e;

    for(int i=0; i<r; i++)
    {
        for(int j=0; j<c; j++)
        {
            cin>>temp;
            matriz[i][j] = temp;
        }
    }

    for(int i=0; i<r; i++)
    {
        for(int j=0; j<c; j++)
        {
            if(matriz[i][j] ==0)
            {
                for(int k=0; k<8;k++)
                {
                    int x = j+ dx[k]; 
                    int y = i+ dy[k];
                    if(x>=0 && y>=0 && x<c&&y<r)
                    {
                        //cout<<x<<"-"<<y<<endl;
                        int u = (i*c)+j;
                        int v = (y*c)+x;
                        //cout<<u<<" "<<v<<endl;
                        adj[u].push_back(pair<int,int> (v, cost[k]));
                    }
                }
            }
        }
    }


//    for(int i =0; i<r*c;i++)
//    {
//        cout<<"u: "<<i<<" -> ";
//        for(int j=0; j<adj[i].size();j++)
//        {
//            cout<<"("<<adj[i][j].first <<" "<<adj[i][j].second<<") ";
//        }
//        cout<<endl;
//    }
//
    vector<int> dist(r*c, 1000005);
    x_s-=1;
    y_s-=1;
    int s= (x_s*c)+y_s;
    dist[s] = 0;
    
    priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>>pq;
    pq.push(pair<int,int>(0,s));

    while(!pq.empty())
    {
        pair<int,int> front = pq.top(); pq.pop();
        int d = front.first, u = front.second;
        if (d>dist[u])
            continue;
        for(int j=0; j<(int)adj[u].size();j++)
        {
            pair<int,int> v = adj[u][j];
            if(dist[u] + v.second < dist[v.first])
            {
                dist[v.first] = dist[u] + v.second;
                pq.push(pair<int,int>(dist[v.first], v.first));
            }
        }
    }

    int res=0;
    for(int i=0; i< r*c; i++)
    {
        //cout<<dist[i]<<" "<<endl;
        if(dist[i]<=e)
        {
            int x = i/c;
            int y = i%c;
            res=max(res,matriz[x][y]);
        }
    }
    
    cout<<res<<endl;


    return 0;
}