#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
const ll MOD=1000000007;
const ll INF=1000000010;
const ll LINF=4000000000000000010LL;
const int MAX=310;
const double EPS=1e-9;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
struct pos{int x,y,h;};
int main(){
	int n,v,ox,oy;cin>>n>>v>>ox>>oy;ox--;oy--;
	int c[210][210];
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			cin>>c[i][j];
		}
	}
	queue<pos> q;
	q.push({0,0,v});
	int ans=0;
	while(!q.empty()){
		pos p=q.front();
		if(p.x==n-1&&p.y==n-1){
			ans=p.h;
			break;
		}
		if(p.x+1<n){
			int nh=p.h+c[p.y][p.x+1];
			if(p.x+1==ox&&p.y==oy){
				nh*=2;
			}
			q.push({p.x+1,p.y,nh});
		}
		if(p.y+1<n){
			int nh=p.h+c[p.y+1][p.x];
			if(p.x==ox&&p.y+1==oy){
				nh*=2;
			}
			q.push({p.x,p.y+1,nh});
		}
	}
	if(ans<0){
		cout<<"NO"<<endl;
	}else{
		cout<<"YES"<<endl;
	}
	return 0;
}