from heapq import *

H, W, X, Y = map(int, input().split())
A = []
for i in range(H):
    A.append(list(map(int, input().split())))
    
S = set()
X, Y = X - 1, Y - 1
S.add((X, Y))
Q = [(A[X][Y], X, Y)]
dx = [1, 0, -1, 0]
dy = [0, 1, 0, -1]
now = A[X][Y]
while Q:
    v, px, py = heappop(Q)
    for k in range(4):
        x = px + dx[k]
        y = py + dy[k]
        if x < 0 or x > H - 1 or y < 0 or y > W - 1:
            continue
        if (x, y) in S:
            continue
        if now <= A[x][y]:
            continue
        S.add((x, y))
        now += A[x][y]
        heappush(Q, (now, x, y))
print("Yes") if len(S) == H * W else print("No")