import heapq


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


def solve(N, V, Ox, Oy, data):
    Sx, Sy = 0, 0
    Gx, Gy = N - 1, N - 1
    distS = dijkstra(Sx, Sy, data, N, V)
    if distS[Gx][Gy] < V:
        return True
    if Ox == -1 and Oy == -1:
        return False
    newV = (V - distS[Ox][Oy]) * 2
    if newV <= 0:
        return False
    distO = dijkstra(Ox, Oy, data, N, newV)
    if distO[Gx][Gy] < newV:
        return True
    return False


def dijkstra(x, y, data, N, V):
    pq = [(0, x, y)]
    dist = [[float('inf')] * N for n in range(N)]
    dist[0][0] = 0
    while pq:
        d, x, y = heapq.heappop(pq)
        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
            newd = d + data[ny][nx]
            if newd >= V or newd >= dist[nx][ny]:
                continue
            dist[nx][ny] = newd
            heapq.heappush(pq, (newd, nx, ny))
    return dist

if __name__ == '__main__':
    N, V, Ox, Oy, data = read_data()
    if solve(N, V, Ox, Oy, data):
        print('YES')
    else:
        print('NO')