#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
const int MAX_N = 100;
const int MAX_V = 10000;
const int INF = (int)1e9 + 7;
using pii = pair<int, int>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

int dp[MAX_N][MAX_N][MAX_V + 1];

int main() {
    int n, v, sj, si, gj, gi;
    cin >> n >> v >> sj >> si >> gj >> gi; sj--, si--, gj--, gi--;
    for (int i = 0; i < MAX_N; i++) for (int j = 0; j < MAX_N; j++) {
        fill_n(dp[i][j], MAX_V + 1, INF);
    }
    int dmg[MAX_N][MAX_N] = {};
    for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) cin >> dmg[i][j];
    queue<pair<pii, int>> que;  // <i, j>, hp
    que.emplace(pii(si, sj), v); dp[si][sj][v] = 0;
    int dij[] = {0, 1, 0, -1, 0};
    auto out_field = [&](int i, int j) {
        return i < 0 || i >= n || j < 0 || j >= n;
    };
    while (!que.empty()) {
        auto p = que.front(); que.pop();
        int i = p.first.first, j = p.first.second, hp = p.second;
        for (int k = 0; k < 4; k++) {
            int ni = i + dij[k], nj = j + dij[k + 1];
            if (out_field(ni, nj)) continue;
            int next_hp = hp - dmg[ni][nj];
            if (next_hp <= 0) continue;
            if (chmin(dp[ni][nj][next_hp], dp[i][j][hp] + 1)) {
                que.emplace(pii(ni, nj), next_hp);
                if (ni == gi && nj == gj) {
                    cout << dp[ni][nj][next_hp] << endl;
                    return 0;
                }
            }
        }
    }
    cout << -1 << endl;
    return 0;
}