#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
typedef vector<int> VI;
typedef vector<VI> VVI;
int dx[] = {0,1,0,-1};
int dy[] = {1,0,-1,0};
bool visited[100][100][10000+1];
int L[111][111];
int main()
{
    int N,V,sx,sy,gx,gy;
    cin>>N>>V>>sx>>sy>>gx>>gy;
    sx--; sy--;
    gx--; gy--;
    FOR(i,N) FOR(j,N) scanf("%d",&L[i][j]);
    queue<int> qu;
    qu.push(sx);
    qu.push(sy);
    qu.push(V);
    qu.push(0);
    memset(visited , 0 , sizeof(visited));
    while(!qu.empty()){
        int x = qu.front(); qu.pop();
        int y = qu.front(); qu.pop();
        int vital = qu.front(); qu.pop();
        int step = qu.front(); qu.pop();
        if(vital <= 0) continue;
        if(visited[x][y][vital]++) continue;
        if(x == gx && y == gy){
            cout<<step<<endl;
            return 0;
        }
        FOR(i,4){
            int nx = x + dx[i];
            int ny = y + dy[i];
            if(BET(0,nx,N) && BET(0,ny,N) && vital >= L[ny][nx]){
                qu.push(nx);
                qu.push(ny);
                qu.push(vital - L[ny][nx]);
                qu.push(step+1);
            }
        }
    }
    puts("-1");
    return 0;
}