#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=(r)-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,-1,0,1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

vector<vector<int>> g(100*100*1801);
unordered_map<int,int> dist;
int main(){
    int n,v,sx,sy,gx,gy;cin >> n >> v >> sy >> sx >> gy >> gx;
    sx--;sy--;gx--;gy--;
    vvl grid(n,vl(n));
    rep(i,n)rep(j,n)cin >> grid[i][j];
    rep(i,n){
        rep(j,n){
            rep(l,4){
                int nx=i+dx[l],ny=j+dy[l];
                if(nx<0||ny<0||nx>=n||ny>=n)continue;
                int cost=grid[nx][ny];
                rep(k,1801){
                    if(k+cost>=1801)break;
                    g[i*n+j+n*n*k].pb(nx*n+ny+n*n*(cost+k));
                }
            }
        }
    }
    vpl fir(n*n,{inf,inf});
	
    queue<ll> que;
    que.push(sx*n+sy);
    dist[sx*n+sy]=0;
  	fir[sx*n+sy]={0,0};
    while(!que.empty()){
        ll vv=que.front();que.pop();
        for(auto p:g[vv]){
            if(dist.count(p))continue;
            if(fir[p%(n*n)].fi<p/(n*n)&&fir[p%(n*n)].se<dist[vv]+1){
                continue;
            }
            if(fir[p%(n*n)].fi>p/(n*n)&&fir[p%(n*n)].se>dist[vv]+1){
                fir[p%(n*n)]={p/(n*n),dist[vv]+1};
            }
            dist[p]=dist[vv]+1;
            que.push(p);
        }
    }
    //rep(i,n*n)cout << fir[i].fi << " " << fir[i].se <<endl;
    //for(auto p:dist)cout << p.fi <<" " << p.se <<endl;
    int ans=inf;
    rep(i,min(1801,v)){
        if(dist.count(gx*n+gy+n*n*i))chmin(ans,dist[gx*n+gy+n*n*i]);
    }
    if(ans<inf/10)cout << ans <<endl;
    else cout << -1 <<endl;
}