from heapq import heappush, heappop N,V,Ox,Oy=map(int,raw_input().split()) L=[[0 for i in range(N)] for j in range(N)] for i in range(N): L[i] = map(int,raw_input().split()) P=[[-1 for i in range(N)] for j in range(N)] pq=[] heappush(pq,(0,0,0)) d1 = [1,0,-1,0] d2 = [0,1,0,-1] while len(pq) != 0: dist,x,y = heappop(pq) if P[x][y] != -1: continue P[x][y]=dist for dx,dy in zip(d1,d2): nx = x+dx ny = y+dy; if nx>=0 and ny >= 0 and nx = 0 and Oy >= 0 and Ox =0 and ny >= 0 and nx 0: #print P[Ox][Oy], ",", P2[N-1][N-1] print "YES" else: print "NO"