from heapq import heappush,heappop
n,v,sy,sx,gy,gx = map(int,input().split())
L = [list(map(int,input().split())) for i in range(n)]
sx,sy,gx,gy = sx-1,sy-1,gx-1,gy-1
inf = 10**10
M = min(v,2000)
dp = [[inf]*(n*n) for i in range(M+1)]
dp[M][sx*n+sy] = 0
h = [[0,M,sx*n+sy]]
while h:
    d,life,ind = heappop(h)
    x,y = divmod(ind,n)
    if dp[life][ind] != d:
        continue

    for (i,j) in ((1,0),(-1,0),(0,1),(0,-1)):
        nx = x+i
        ny = y+j
        if 0 <= nx < n and 0 <= ny < n:
            nind = nx*n+ny
            if life > L[nx][ny] and dp[life-L[nx][ny]][nind] > d+1:
                dp[life-L[nx][ny]][nind] = d+1
                heappush(h,[d+1,life-L[nx][ny],nind])

ans = inf
for i in range(M+1):
    ans = min(ans,dp[i][gx*n+gy])
if ans == inf:
    ans = -1
print(ans)