import sys
from heapq import heapify, heappush, heappop
input = lambda: sys.stdin.readline().rstrip()\

dx = [-1, 0, 0, 1]
dy = [0, -1, 1, 0]

#  -----------------------  #

h, w, y, x = map(int, input().split())
x -= 1
y -= 1

A = [list(map(int, input().split())) for _ in range(h)]

hq = [(0, y, x)]
now = A[y][x]

seen = [[False]*w for _ in range(h)]
seen[y][x] = True

def is_infield(y, x):
  return 0 <= y < h and 0 <= x < w

killed = 0
while hq:
  a, vy, vx = heappop(hq)
  if now <= a:
    print('No')
    exit()
  killed += 1
  now += a
  for i in range(4):
    ny, nx = vy+dy[i], vx+dx[i]
    if not is_infield(ny, nx):
      continue
    if seen[ny][nx]:
      continue
    seen[ny][nx] = True
    heappush(hq, (A[ny][nx], ny, nx))

if killed == h*w:
  print('Yes')
else:
  print('No')