from heapq import heappop, heappush
h, w, x, y = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(h)]
x -= 1
y -= 1
dis = [1, 0, -1, 0]
djs = [0, 1, 0, -1]
added = [[False] * w for _ in range(h)]
added[x][y] = True

q = []

def add_neighbor(i, j):
    for di, dj in zip(dis, djs):
        ni = i + di
        nj = j + dj
        if 0 <= ni < h and 0 <= nj < w and not added[ni][nj]:
            added[ni][nj] = True
            heappush(q, (a[ni][nj], (ni, nj)))

now = a[x][y]
added[x][y] = True
add_neighbor(x, y)

while q:
    v, (i, j) = heappop(q)
    if v >= now:
        print('No')
        break
    now += v
    add_neighbor(i, j)
else:
    print('Yes')