from collections import deque
H,W,y,x = map(int, input().split())
y -= 1
x -= 1
A = [list(map(int, input().split())) for _ in range(H)]
amax = 0
for i in range(H):
    amax = max(amax, max(A[i]))
B = [[0 for _ in range(W)] for _ in range(H)]
B[y][x] = 1
cnt = 1
tot = A[y][x]
que = deque([])
for dy,dx in [(1,0),(-1,0),(0,1),(0,-1)]:
    if 0<=y+dy<H and 0<=x+dx<W and B[y+dy][x+dx]==0:
        B[y+dy][x+dx] = 1
        cnt += 1
        que.append((y+dy,x+dx))
ans = "No"
cnt0 = cnt
while que:
    i,j = que.popleft()
    if tot>A[i][j]:
        tot += A[i][j]
        for dy,dx in [(1,0),(-1,0),(0,1),(0,-1)]:
            if 0<=i+dy<H and 0<=j+dx<W and B[i+dy][j+dx]==0:
                B[i+dy][j+dx] = 1
                cnt += 1
                que.append((i+dy,j+dx))
    else:
        que.append((i,j))
    if tot>amax:
        ans = "Yes"
        break
    if cnt==cnt0:break
    cnt0 = cnt
print(ans)