from heapq import *

H,W,Y,X=map(int,input().split())

A=[[-1]*(W+2) for _ in range(H+2)]
for i in range(1,H+1):
    for j,a in enumerate(map(int,input().split()),1):
        A[i][j]=a

Q=[]
T=[[0]*(W+2) for _ in range(H+2)]; T[Y][X]=1

dx=[1,0,-1,0]; dy=[0,1,0,-1]
for d in range(4):
    py=Y+dy[d]; px=X+dx[d]
    if A[py][px]!=-1:
        heappush(Q,(A[py][px],py,px))
        T[py][px]=1

remain=H*W-1; attack=A[Y][X]
while Q:
    a,i,j=heappop(Q)
    if attack<=a:
        break

    attack+=a
    remain-=1

    for d in range(4):
        py=i+dy[d]; px=j+dx[d]
        if A[py][px]!=-1 and T[py][px]==0:
            heappush(Q,(A[py][px],py,px))
            T[py][px]=1

print("Yes" if remain==0 else "No")