from collections import deque
import heapq
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
DX = (-1, 0, 1, 0, -1, -1, 1, 1)
DY = (0, 1, 0, -1, -1, 1, -1, 1)
DX = DX[:4]
DY = DY[:4]


N, V, sy, sx, gy, gx = map(int, input().split())
sx -= 1
sy -= 1
gx -= 1
gy -= 1
L = tuple(tuple(map(int, input().split())) for _ in range(N))
Nsq = N*N

dist = [[-1]*(V+1) for _ in range(N*N)]
dist[sx*N+sy][V] = 0
que = deque([(sx*N+sy, V)])
ans = -1
while que:
    xy, v = que.popleft()
    x, y = divmod(xy, N)
    d = dist[xy][v]
    if (x, y) == (gx, gy):
        ans = d
        break
    for dx, dy in zip(DX, DY):
        nx = x + dx
        ny = y + dy
        if 0 <= nx < N and 0 <= ny < N and v - L[nx][ny] > 0:
            nv = v - L[nx][ny]
            nxy = nx * N + ny
            if dist[nxy][nv] == -1:
                dist[nxy][nv] = d + 1
                que.append((nxy, nv))

print(ans)