import heapq
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
inf = 100000
U = 10009
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())
L = tuple(tuple(map(int, input().split())) for _ in range(N))
sy -= 1
sx -= 1
gx -= 1
gy -= 1

dist = [[[inf] * (U + 1) for _ in range(N)] for _ in range(N)]
dist[0][0][0] = 0
que = [(0, 0, sx, sy)]
while que:
    d, hp, x, y = heapq.heappop(que)
    if (x, y) == (gx, gy):
        print(dist[gx][gy][hp])
        exit()
    if dist[x][y][hp] < d:
        continue
    for dx, dy in zip(DX, DY):
        nx = x + dx
        ny = y + dy
        if 0 <= nx < N and 0 <= ny < N and hp + L[nx][ny] < V:
            nhp = hp + L[nx][ny]
            if dist[nx][ny][nhp] > d + 1:
                dist[nx][ny][nhp] = d + 1
                heapq.heappush(que, (d+1, nhp, nx, ny))

print(-1)