#include <iostream>
#include <queue>
#include <vector>
#include <climits>
#include <bits/stdc++.h>

using namespace std;

int main() {
    int N, V, Sy, Sx, Gy, Gx;
    cin >> N >> V >> Sy >> Sx >> Gy >> Gx;
    Sx--; Sy--; Gx--; Gy--;

    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];
        }
    }

    const long long inf = LLONG_MAX;
    vector<vector<long long>> dist(18 * N, vector<long long>(N * N, inf));
    dist[0][Sx * N + Sy] = 0;
    deque<tuple<long long, int, int, int>> queue;
    queue.push_back(make_tuple(0, 0, Sx, Sy));

    while (!queue.empty()) {
        tuple<long long, int, int, int> tup = queue.front();
        long long d = get<0>(tup);
        int v = get<1>(tup);
        int x = get<2>(tup);
        int y = get<3>(tup);

        queue.pop_front();

        if (dist[v][x * N + y] < d) {
            continue;
        }

        for (auto [dx, dy] : vector<pair<int, int>>{{0, 1}, {1, 0}, {0, -1}, {-1, 0}}) {
            int xx = x + dx;
            int yy = y + dy;

            if (0 <= xx && xx < N && 0 <= yy && yy < N) {
                int vv = v + L[xx][yy];

                if (vv < 18 * N && dist[vv][xx * N + yy] > d + 1) {
                    dist[vv][xx * N + yy] = d + 1;
                    queue.push_back({d + 1, vv, xx, yy});
                }
            }
        }
    }

    long long ans = inf;
    for (int v = 0; v < 18 * N; ++v) {
        if (v < V) {
            ans = min(ans, dist[v][Gx * N + Gy]);
        }
    }

    if (ans == inf) {
        ans = -1;
    }

    cout << ans << endl;

    return 0;
}