#include <iostream>
using namespace std;
int N,V,field[201][201];
int dp[201][201];
int direction[5]={-1,0,1,0,-1};
struct Struct{
        int y,x;
};
Struct oasis;
bool recursion(int h,int w,int hp){
        if(h<0 || h>=N )return false;
        if(w<0 || w>=N )return false;
        hp-=field[h][w];
        if(h==oasis.y && w==oasis.x && oasis.x+oasis.y!=0 )
                hp*=2;
        if(hp<0)return false;
        if(h==N-1 && w==N-1 )return true;
        if(dp[h][w]>=hp)return false;
        dp[h][w]=hp;
        bool response=false;
        for(int i=0 ; i<4 ; i++ )
                response|=recursion(h+direction[i],w+direction[i+1],hp);
        return response;
}
int main(){
        cin >> N >> V;
        cin >> oasis.x >> oasis.y;
        for(int i=0 ; i<N ; i++ ){
                for(int j=0 ; j<N ; j++ ){
                        cin >> field[i][j];
                        dp[i][j]=-1;
                }
        }
        if(recursion(0,0,V))
                cout <<"YES"<<endl;
        else
                cout<<"NO"<<endl;
        return 0;
}