#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
template<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}
template<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}
template<class T> T div_floor(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>=0 ? a/b : (a+1)/b-1;
}
template<class T> T div_ceil(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>0 ? (a-1)/b+1 : a/b;
}

constexpr lint mod = 1e9+7;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;

int n, V, sx, sy, gx, gy, L[110][110], d[110][110][210];
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};

int main(){
    scanf("%d%d%d%d%d%d", &n, &V, &sy, &sx, &gy, &gx);
    --sx;  --sy; --gx; --gy;
    rep(i, n)rep(j, n) scanf("%d", &L[i][j]);

    rep(i, n)rep(j, n)rep(k, 210) d[i][j][k] = mod;
    queue<tuple<int, int, int, int>> que;
    que.emplace(0, sx, sy, 0);
    d[sx][sy][0] = 0;
    int ans = mod;
    while(!que.empty()){
        auto [tv, x, y, td] = que.front();
        que.pop();
        if((abs(gx-x) + abs(gy-y))*9 < V-tv){
            chmin(ans, td + abs(gx-x) + abs(gy-y));
            continue;
        }
        rep(i, 4){
            int nx = x + dx[i], ny = y + dy[i];
            if(0<=nx && nx<n && 0<=ny && ny<n){
                if(tv+L[nx][ny] < V && td+1 < 210 && chmin(d[nx][ny][td+1], tv+L[nx][ny])){
                    if(nx == gx && ny == gy){
                        chmin(ans, td+1);
                        continue;
                    }
                    que.emplace(d[nx][ny][td+1], nx, ny, td+1);
                }
            }
        }
    }

    printf("%d\n", ans < mod ? ans : -1);
}