#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <fstream>
#include <sstream>
using namespace std;
typedef long long ll;

const int INF = 1 << 20;

int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};

struct State {
    int x, y, d;
};

int rest[100][100][10001];
bool inQ[100][100][10001];

int N, V, Sx, Sy, Gx, Gy;
int in[110][110];

int solve(){
    queue<State> Q;
    Q.push(State{Sx, Sy, 0});
    
    rest[Sx][Sy][0] = V;
    inQ[Sx][Sy][0] = true;
    
    int res = INF;
    while(!Q.empty()){
        State s = Q.front(); Q.pop();
        int x = s.x, y = s.y, d = s.d, v = rest[x][y][d];
        
        inQ[x][y][d] = false;
        
        if(x == Gx && y == Gy){
            res = min(res, d);
            continue;
        }
        
        for(int i=0;i<4;i++){
            int nd = d + 1;
            
            int ny = y + dy[i];
            int nx = x + dx[i];
            if(ny < 0 || ny >= N || nx < 0 || nx >= N)continue;
            
            int nv = v - in[nx][ny];
            if(nv <= rest[nx][ny][nd])continue;
            if(inQ[nx][ny][nd])continue;
            
            Q.push(State{nx, ny, nd});
            
            rest[nx][ny][nd] = nv;
            inQ[nx][ny][nd] = true;
        }
    }
    
    if(res >= INF){
        return -1;
    } else {
        return res;
    }
}

int main(){
    cin >> N >> V >> Sx >> Sy >> Gx >> Gy;
    
    --Sx; --Sy;
    --Gx; --Gy;
    
    for(int y=0;y<N;y++)for(int x=0;x<N;x++){
        cin >> in[x][y];
    }
    
    cout << solve() << endl;
    return 0;
}