#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())
#define indexOf(v,x) (find(all(v),x)-v.begin())

int n,v,ox,oy;
int L[200][200];
int maxv[200][200][2];

struct S{
	int v,y,x,u;
	S(){}
	S(int a,int b,int c,int d):v(a),y(b),x(c),u(d){}
	bool operator <(const S &s)const {return v<s.v;}
};
int dy[]={-1,0,1,0};
int dx[]={0,1,0,-1};

int main(){
	cin>>n>>v>>ox>>oy;
	ox--;oy--;
	rep(i,n)rep(j,n)cin>>L[i][j];
	fill(maxv[0][0],maxv[200][0],0);

	priority_queue<S> pq;
	pq.push(S(v,0,0,0));
	maxv[0][0][0]=v;
	while(!pq.empty()){
		S a,b;
		a=pq.top();pq.pop();
		rep(j,4){
			b=a;
			b.y+=dy[j];b.x+=dx[j];
			if(b.y<0||n<=b.y||b.x<0||n<=b.x)continue;
			b.v-=L[b.y][b.x];
			if(b.y==oy&&b.x==ox && b.u==0){
				b.v*=2;
				b.u=1;
			}
			if(0<b.v && b.v>maxv[b.y][b.x][b.u]){
				maxv[b.y][b.x][b.u]=b.v;
				pq.push(b);
			}
		}
	}
	cout<<(0<maxv[n-1][n-1][0]||0<maxv[n-1][n-1][1]?"YES":"NO")<<endl;
	return 0;
}