import heapq
import sys
input = sys.stdin.readline


h,w,y,x = map(int,input().split())
a = [list(map(int,input().split())) for _ in range(h)]
y -= 1
x -= 1

visited = [[False]*w for _ in range(h)]

hq = []
now = a[y][x]
visited[y][x] = True

didj = [(1,0),(0,1),(0,-1),(-1,0)]
for di,dj in didj:
    ni = y + di
    nj = x + dj
    if 0 <= ni < h and 0 <= nj < w:
        heapq.heappush(hq,(a[ni][nj] , ni,nj))
        visited[ni][nj] = True

while hq:
    a_nxt,i,j = heapq.heappop(hq)
    if now <= a_nxt:
        print("No")
        exit()
    now += a_nxt
    for di , dj in didj:
        ni = i + di
        nj = j + dj
        if 0 <= ni < h and 0 <= nj < w and not visited[ni][nj]:
            heapq.heappush(hq,(a[ni][nj],ni,nj))
            visited[ni][nj] = True

print("Yes")