from heapq import *

h, w, x, y = map(int, input().split())
x -= 1
y -= 1
A = [list(map(int, input().split())) for _ in range(h)]
hq = []
directions = [(-1, 0), (1, 0), (0, -1), (0, 1)]
tot = A[x][y]
used = [[False] * w for _ in range(h)]
used[x][y] = True

for dx, dy in directions:
    nx = x + dx
    ny = y + dy
    if nx == -1 or nx == h or ny == -1 or ny == w:
        continue
    heappush(hq, (A[nx][ny], nx, ny))
    used[nx][ny] = True

while hq:
    a, x, y = heappop(hq)
    if a >= tot:
        print("No")
        exit()
    tot += a
    for dx, dy in directions:
        nx = x + dx
        ny = y + dy
        if nx == -1 or nx == h or ny == -1 or ny == w:
            continue
        if used[nx][ny]:
            continue
        heappush(hq, (A[nx][ny], nx, ny))
        used[nx][ny] = True


print("Yes")