#include "bits/stdc++.h"

using namespace std;

using ll = long long;
using ld = long double;

const double PI = 3.1415926535897932384626433832795;

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

int gcd(int x, int y) { return y ? gcd(y, x % y) : abs(x); }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : abs(x); }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }

int n, hp, sx, sy, gx, gy;

struct state {
	int y;
	int x;
	int cost;
	int turn;
};

int bfs(const vector<vector<int>> &g) {
	queue<state> que;
	vector<vector<int>> dp(n, vector<int>(n, INT_MAX));

	que.push({ sy, sx, 0, 0 });
	while (!que.empty()) {
		state st = que.front(); que.pop();
		for (int i = 0; i < 4; i++) {
			int ny = st.y + dy[i];
			int nx = st.x + dx[i];

			if (ny < 0 || ny >= n || nx < 0 || nx >= n) {
				continue;
			}

			int nCost = st.cost + g[ny][nx];
			if (nCost >= hp) {
				continue;
			}


			if (ny == gy && nx == gx) {
				return st.turn + 1;
			}

			if (nCost >= dp[ny][nx]) {
				continue;
			}
			dp[ny][nx] = nCost;
			que.push({ ny, nx, nCost, st.turn + 1 });
		}
	}

	return -1;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n >> hp >> sx >> sy >> gx >> gy;
	sx--; sy--;
	gx--; gy--;

	vector<vector<int>> g(n, vector<int>(n));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			cin >> g[i][j];
		}
	}

	cout << bfs(g) << endl;
	return 0;
}