#include <bits/stdc++.h>
using namespace std;
int N, V, sx, sy, gx, gy;
int L[100][100];
// (vital, x, y) => length
int dp[10000][100][100];
const int dir[4][2] = {{0, 1}, {-1, 0}, {0, -1}, {1, 0}};
const int INF = 100000000;

// v: vital, x:x coord, y:y coord, l:length, od: old direction
void recursive(int v, int x, int y, int l, int od) {
	if (v <= 0 || dp[v][y][x] <= l) return;
	dp[v][y][x] = l;
	if(x == gx && y == gy) return;
	for(int d = 0; d < 4; d++) {
		int nx = x + dir[d][1], ny = y + dir[d][0];
		if(nx < 0 || N <= nx || ny < 0 || N <= ny || d == od) continue;
		recursive(v - L[ny][nx], nx, ny, l + 1, d ^ 2);
	}
}

int main() {
	#ifdef DEBUG
	std::ifstream in("/home/share/inputf.in");
	std::cin.rdbuf(in.rdbuf());
	#endif
	cin >> N >> V >> sx >> sy >> gx >> gy;
	sx--, sy--, gx--, gy--;
	for(int i = 0; i < N; i++) {
		for(int j = 0; j < N; j++) {
			cin >> L[i][j];
			for(int k = 0; k < 10000; k++) {
				dp[k][i][j] = INF;
			}
		}
	}
	recursive(V, sx, sy, 0, -1);
	int ans = INF;
	for(int i = 0; i < 10000; i++) {
		if(dp[i][gy][gx] == 0) continue;
		ans = min(ans, dp[i][gy][gx]);
	}
	if(ans == INF) ans = -1;
	cout << ans << endl;
	return 0;
}