#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
    int n,v;
    cin>>n>>v;
    int x,y;
    cin>>y>>x;
    x--;y--;
    vector<vector<int> >l(n,vector<int>(n));
    for(int i = 0;i<n;i++)for(int j = 0;j<n;j++) cin>>l[i][j];
    vector<vector<vector<int> > > vis(n,vector<vector<int> >(n,vector<int>(2,-1)));
    vis[0][0][0] = v;
    priority_queue<pair<pair<int,int>,pair<int,int> > > que;
    que.push(make_pair(make_pair(v,0),make_pair(0,0)));
    int dx[] = {1,-1,0,0};
    int dy[] = {0,0,1,-1};
    while(que.size()){
       int i,j;
       tie(i,j) = que.top().second;
       int now,k;
       tie(now,k) = que.top().first;
       que.pop();
       if(now<vis[i][j][k]) continue;
       if(k==0&&i==x&&j==y){
           int nxt = now * 2;
           if(vis[i][j][1]<nxt){
               vis[i][j][1] = nxt;
               que.push(make_pair(make_pair(nxt,1),make_pair(i,j)));
           }
       }
       for(int kk = 0;kk<4;kk++){
           int ni = i + dx[kk];
           int nj = j + dy[kk];
           if(ni<0||ni>=n||nj<0||nj>=n) continue;
           int nxt = now - l[ni][nj];
           if(nxt<=0) continue;
           if(nxt<=vis[ni][nj][k]) continue;
           vis[ni][nj][k] = nxt;
           que.push(make_pair(make_pair(nxt,k),make_pair(ni,nj)));
       }
    }
    if(vis[n-1][n-1][0]>0||vis[n-1][n-1][1]>0) cout<<"YES\n";
    else cout<<"NO\n";
       
}