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

int dp[100][100][2001];
int board[100][100];

int N;
bool ok(int a, int b){
	return a >= 0 && b >= 0 && a < N && b < N;
}

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

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

	Sy--; Sx--; Gy--; Gx--;
	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < N; j++)
		{
			cin >> board[i][j];
		}
	}

	V = min(V, 2000);
	dp[Sy][Sx][V] = 1;
	queue<tuple<int, int, int>> q;
	q.push(make_tuple(Sy, Sx, V));

	while (!q.empty()){
		auto now = q.front(); q.pop();
		int y = get<0>(now);
		int x = get<1>(now);
		int v = get<2>(now);

		for (int k = 0; k < 4; k++)
		{
			int ny = y + dy[k];
			int nx = x + dx[k];
			if (!ok(ny, nx)) continue;
			int nv = v - board[ny][nx];
			if (nv <= 0) continue;
			if (dp[ny][nx][nv]) continue;
			if (ny == Gy && nx == Gx){
				cout << dp[y][x][v] << endl;
				return 0;
			}
			dp[ny][nx][nv] = dp[y][x][v] + 1;
			q.push(make_tuple(ny, nx, nv));
		}
	}

	cout << -1 << endl;
}