def read_data():
    N, V, Sx, Sy, Gx, Gy = map(int, input().split())
    data = [list(map(int, input().split())) for n in range(N)]
    return N, V, Sx - 1, Sy - 1, Gx - 1, Gy - 1, data


def solve(N, V, Sx, Sy, Gx, Gy, data):
    fs = dict()
    fs[Sx, Sy] = V
    vs = [[0] * N for n in range(N)]
    vs[Sx][Sy] = V
    steps = 0
    while fs:
        steps += 1
        nfs = dict()
        for (x, y), v in fs.items():
            for nx, ny in [(x-1, y), (x+1, y), (x, y-1), (x, y+1)]:
                if nx < 0 or nx >= N or ny < 0 or ny >= N:
                    continue
                newv = v - data[ny][nx]
                if newv <= vs[nx][ny]:
                    continue
                vs[nx][ny] = newv
                nfs[nx, ny] = newv
                if nx == Gx and ny == Gy:
                    return steps
        fs = nfs
    return -1

if __name__ == '__main__':
    N, V, Sx, Sy, Gx, Gy, data = read_data()
    print(solve(N, V, Sx, Sy, Gx, Gy, data))