#include<bits/stdc++.h>

using namespace std;
typedef unsigned int uint;
typedef long long int ll;
typedef unsigned long long int ull;

#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;
#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;
#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}
#define debugaa0(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y][0]<<" ";}cout<<endl;}
#define debugaa1(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y][1]<<" ";}cout<<endl;}
#define ALL(v) (v).begin(),(v).end()
#define BIGINT 0x7FFFFFFF
#define E107 1000000007

template<typename T1,typename T2>
ostream& operator <<(ostream &o,const pair<T1,T2> p){o<<"("<<p.first<<":"<<p.second<<")";return o;}

int maze[250][250];
int dp[250][250][2];

int n;

int main(){
    int i,j,k,l,x,y;
    int hp,ox,oy;
    
    cin>>n>>hp>>ox>>oy;

    for (y=1;y<=n;y++)
        for (x=1;x<=n;x++){
            scanf("%d",&maze[x][y]);
            maze[x][y]++;
        }
                      // -------------------------------------------------------------------------------------------
    hp+=maze[1][1]-1; // 次のマスへ移動すると、移動した先の砂漠レベル分の体力が減る。-> スタート地点は減算しない！！
        
    priority_queue<int> q;
    
    q.push((hp<<16)|(1<<8)|(1));
    dp[1][1][0]=1;
    
    //int sushi=0;
    while (!q.empty()){
        l=q.top();q.pop();
        k= (l>>28);
        hp=(l>>16)&0xFFF;
        x =(l>> 8)&0xFF;
        y =(l    )&0xFF;
        
        hp-=maze[x][y]-1;
        
        if (hp<=0) continue;
        if (x==n&&y==n){puts("YES");return 0;}
        if (ox==x && oy==y && !k){hp*=2;k=1;}
        
        if (dp[x-1][y][k]<hp && maze[x-1][y] && maze[x-1][y]<=hp){
            dp[x-1][y][k]=hp;q.push((k<<28)|(hp<<16)|((x-1)<<8)|(y));
        }
        if (dp[x+1][y][k]<hp && maze[x+1][y] && maze[x+1][y]<=hp){
            dp[x+1][y][k]=hp;q.push((k<<28)|(hp<<16)|((x+1)<<8)|(y));
        }
        if (dp[x][y-1][k]<hp && maze[x][y-1] && maze[x][y-1]<=hp){
            dp[x][y-1][k]=hp;q.push((k<<28)|(hp<<16)|((x)<<8)|(y-1));
        }
        if (dp[x][y+1][k]<hp && maze[x][y+1] && maze[x][y+1]<=hp){
            dp[x][y+1][k]=hp;q.push((k<<28)|(hp<<16)|((x)<<8)|(y+1));
        }
    }
    puts("NO");
    // debugaa0(dp,n+1,n+1);
    // debugaa1(dp,n+1,n+1);

    return 0;
}