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 = []
dx = [1, 0, -1, 0]
dy = [0, 1, 0, -1]
for k in range(4):
    x = X + dx[k]
    y = Y + dy[k]
    if x < 0 or x > H - 1 or y < 0 or y > W - 1:
        continue
    heappush(Q, (A[x][y], x, y))
    S.add((x, y))

now = A[X][Y]
while Q:
    v, px, py = heappop(Q)
    if v >= now:
        print("No")
        exit()
    now += v
    
    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
        S.add((x, y))
        heappush(Q, (A[x][y], x, y))
print("Yes")