import heapq
dxdy = ((0, 1), (0, -1), (1, 0), (-1, 0))
h, w, x, y = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(h)]
d = [[0] * w for _ in range(h)]
d[x - 1][y - 1] = 1
hq = [(a[x - 1][y - 1], x - 1, y - 1)]
t = 0
cnt = 0
while hq:
    p, x, y = heapq.heappop(hq)
    if cnt > 0 and t <= a[x][y]:
        print('No')
        exit(0)
    cnt += 1
    t += a[x][y]
    for dx, dy in dxdy:
        if 0 <= x + dx < h and 0 <= y + dy < w and d[x + dx][y + dy] == 0:
            d[x + dx][y + dy] = 1
            heapq.heappush(hq, (a[x + dx][y + dy], x + dx, y + dy))
print('Yes')