// yukicoder: No.34 砂漠の行商人
// 2019.6.30 bal4u

#include <stdio.h>

#if 1
#define gc() getchar_unlocked()
#else
#define gc() getchar()
#endif

int in() {   // 非負整数の入力
	int n = 0, c = gc();
	do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0');
	return n;
}

#define QMAX 5000000
typedef struct { int r, c, v, t; } Q;
Q q[QMAX+5]; int top, end;
int N;
char map[103][103];
int mv[4][2] = {{0,-1},{-1,0},{0,1},{1,0}};
unsigned vis[103][103][626];

int bfs(int V, int sr, int sc, int gr, int gc) {
	int i, r, c, v, t, rr, cc;
	
	top = 0, end = 1;
	q[0].r = sr, q[0].c = sc, q[0].v = V, q[0].t = 0;
	while (top != end) {
		r = q[top].r, c = q[top].c, v = q[top].v, t = q[top].t;
		if (++top == QMAX) top = 0;
		if (r == gr && c == gc) return t;
		if (vis[r][c][v>>4] & (1<<(v&15))) continue;
		vis[r][c][v>>4] |= 1<<(v&15);
		for (i = 0; i < 4; i++) {
			rr = r + mv[i][0], cc = c + mv[i][1];
			if (rr < 0 || rr >= N || cc < 0 || cc >= N) continue;
			if (v <= map[rr][cc]) continue;
			q[end].r = rr, q[end].c = cc, q[end].v = v-map[rr][cc], q[end].t = t+1;
			if (++end == QMAX) end = 0;
		}
	}
	return -1;
}
		
int main()
{
	int r, c, V, sr, sc, gr, gc;

	N = in(), V = in();
	sc = in()-1, sr = in()-1, gc = in()-1, gr = in()-1;
	for (r = 0; r < N; r++) for (c = 0; c < N; c++) {
		map[r][c] = gc() & 0xf, gc();
	}
	printf("%d\n", bfs(V, sr, sc, gr, gc));
	return 0;
}