from heapq import heappush, heappop, heapify N,v,ox,oy=map(int, input().split()) l=[list(map(int, input().split())) for i in range(N)] mc=[[-1 for i in range(N)] for j in range(N)] a=[(0,0,0)] heapify(a) while mc[N-1][N-1]==-1 or mc[oy-1][ox-1]==-1: n=heappop(a) nc=n[0] ny=n[1] nx=n[2] if(mc[ny][nx]==-1): mc[ny][nx]=nc else: continue if(nx>0): if(mc[ny][nx-1]==-1): heappush(a, (nc+l[ny][nx-1],ny,nx-1)) if(ny>0): if(mc[ny-1][nx]==-1): heappush(a, (nc+l[ny-1][nx],ny-1,nx)) if(nx=v): print("NO") quit() v=(v-mc[oy-1][ox-1])*2 mc=[[-1 for i in range(N)] for j in range(N)] a=[(0,oy-1,ox-1)] heapify(a) while mc[N-1][N-1]==-1: n=heappop(a) nc=n[0] ny=n[1] nx=n[2] if(mc[ny][nx]==-1): mc[ny][nx]=nc else: continue if(nx>0): if(mc[ny][nx-1]==-1): heappush(a, (nc+l[ny][nx-1],ny,nx-1)) if(ny>0): if(mc[ny-1][nx]==-1): heappush(a, (nc+l[ny-1][nx],ny-1,nx)) if(nx