#include<bits/stdc++.h>
using namespace std;

#define int long long

typedef long long ll;
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ln <<endl
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}

struct data{
    int y,x,h;
    data(int y,int x,int h):y(y),x(x),h(h){}
};

int dxy[]={0,-1,0,1,0};

int N,V,sx,sy,gx,gy;
int L[100][100];
int dist[100][100][2000];
signed main(){
    cin>>N>>V>>sx>>sy>>gx>>gy;sx--;sy--;gx--;gy--;
    chmin(V,2000);
    rep(i,N)rep(j,N)cin>>L[i][j];

    queue<data>que;
    que.push(data(sy,sx,0));
    fill_n(**dist,100*100*2000,1<<25);
    dist[sy][sx][0]=0;

    while(que.size()){
        data d=que.front();que.pop();
        rep(i,4){
            int ny=d.y+dxy[i],nx=d.x+dxy[i+1];
            if(ny<0||ny>=N||nx<0||nx>=N)continue;
            int nh=d.h+L[ny][nx];
            if(nh>=V||dist[ny][nx][nh]<=dist[d.y][d.x][d.h]+1)continue;
            dist[ny][nx][nh]=dist[d.y][d.x][d.h]+1;
            que.push(data(ny,nx,nh));
        }
    }

    int mi=1<<25;
    rep(i,V)chmin(mi,dist[gy][gx][i]);
    if(mi==(1<<25))cout<<-1<<endl;
    else cout<<mi<<endl;
    return 0;
}