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

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

void solve(){
    int n, v, sy, sx, gy, gx;
    cin >> n >> v >> sy >> sx >> gy >> gx;
    vector<vector<int>> L(n, vector<int>(n));
    for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) cin >> L[i][j];
    sx--; sy--; gx--; gy--;
    auto f = [&](int i, int j, int k) -> int{
        return (i * n + j) * v + k;
    };
    vector<int> dist(n * n * v, -1);
    dist[f(sx, sy, v - 1)] = 0;
    queue<int> que;
    que.push(f(sx, sy, v - 1));
    while(!que.empty()){
        int tmp = que.front();
        que.pop();
        int x = tmp / (n * v);
        tmp -= x * n * v;
        int y = tmp / v;
        int vv = tmp - y * v;
        for(int t = 0; t < 4; t++){
            int nx = x + dx[t];
            int ny = y + dy[t];
            if(nx == -1 || nx == n || ny == -1 || ny == n) continue;
            int nv = vv - L[nx][ny];
            if(nv < 0) continue;
            if(dist[f(nx, ny, nv)] == -1){
                if(nx == gx && ny == gy){
                    cout << dist[f(x, y, vv)] + 1 << "\n";
                    return;
                }
                dist[f(nx, ny, nv)] = dist[f(x, y, vv)] + 1;
                que.push(f(nx, ny, nv));
            }
        }
    }
    cout << "-1\n";
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    int t;
    t = 1;
    //cin >> t;
    while(t--) solve();
}