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

int main() {
    int N, V, Sx, Sy, Gx, Gy;
    cin >> N >> V >> Sx >> Sy >> Gx >> Gy;
    int L[110][110];
    for (int i = 0; i < N + 2; i++) {
        for (int j = 0; j < N + 2; j++) {
            L[i][j] = 100000;
        }
    }
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            cin >> L[j + 1][i + 1];
        }
    }


    int dp[110][110][2] = {};
    dp[Sx][Sy][0] = V;

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

    int now = 0, nxt = 1;
    int cnt = 0;
    for (int loop = 0; loop < N * N; loop++) {
        if (dp[Gx][Gy][now]) {
            cout << cnt << endl;
            return 0;
        }
        cnt++;
        for (int x = 1; x <= N; x++) {
            for (int y = 1; y <= N; y++) {
                dp[x][y][nxt] = 0;
            }
        }
        for (int x = 1; x <= N; x++) {
            for (int y = 1; y <= N; y++) {
                if (dp[x][y][now]) {
                    for (int i = 0; i < 4; i++) {
                        dp[x + dx[i]][y + dy[i]][nxt] = max(dp[x + dx[i]][y + dy[i]][nxt], dp[x][y][now] - L[x + dx[i]][y + dy[i]]);
                    }
                }
            }
        }
        swap(now, nxt);
    }
    cout << -1 << endl;
}