#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;

#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP(i,n,0)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 100000000

typedef long long ll;

int main() {
    int i, j, n, v, sx, sy, gx, gy;
    int l[101][101], cost[101][101];
    queue<tuple<int,int,int,int>> q;
    cin >> n >> v >> sx >> sy >> gx >> gy;
    REP (i,1,n+1) REP (j,1,n+1) cin >> l[j][i];
    q.push(make_tuple(sx,sy,0,0));
    REP (i,1,n+1) fill(cost[i]+1,cost[i]+n+1,INF);
    cost[sx][sy] = 0;
    while (!q.empty()) {
        int x, y, d, c;
        int dx[4] {-1,0,1,0};
        tie(x,y,d,c) = q.front(); q.pop();
        if (x == gx && y == gy) {
            cout << d << endl;
            return 0;
        }
        rep (i,4) {
            int nx = x+dx[i];
            int ny = y+dx[(i+1)%4];
            if (min(nx,ny) >= 1 && max(nx,ny) <= n && c+l[nx][ny] < v && c+l[nx][ny] < cost[nx][ny]) {
                cost[nx][ny] = c+l[nx][ny];
                q.push(make_tuple(nx,ny,d+1,cost[nx][ny]));
            }
        }
    }
    cout << -1 << endl;
    return 0;
}