#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;
}
struct state{
    int x,y,l;
};
int dist[101][101][1801];
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];
    queue<state> que;
    que.push({sx,sy,0});
    rep(i,101)rep(j,101)rep(k,1801)dist[i][j][k]=-1;
    dist[sx][sy][0]=0;
    while(!que.empty()){
        state v=que.front();que.pop();
        rep(i,4){
            int nx=dx[i]+v.x,ny=dy[i]+v.y;
            if(nx<0||ny<0||nx>=n||ny>=n)continue;
            int p=grid[nx][ny];
            if(v.l+p>=1801)continue;
            if(dist[nx][ny][v.l+p]!=-1)continue;
            dist[nx][ny][v.l+p]=dist[v.x][v.y][v.l]+1;
            que.push({nx,ny,v.l+p});
        }
    }
    int ans=inf;
    rep(i,min(v,1800)){
        if(dist[gx][gy][i]!=-1)chmin(ans,dist[gx][gy][i]);
    }
    cout << ans <<endl;
}