#include <iostream>
#include <algorithm>
#include <vector>
#include <list>
#include <cstdio>
#include <cmath>

using namespace std;

int n,hp,ox,oy;
vector<vector<int>> map;

int foot[201][201][2];

int main(){
    int i,j,k;
    cin>>n>>hp>>ox>>oy;
    
    map.push_back(vector<int>());
    for (i=0;i<n;i++){
        map.push_back(vector<int>());
        vector<int> &v=map.back();
        v.push_back(999);
        for(j=0;j<n;j++){
            cin>>k;
            v.push_back(k);
        }
    }
    k=0;
    list<vector<int>> queue;
    queue.push_back(vector<int>{1,1,hp,0});
    for (;!queue.empty();queue.pop_front()){k++;
        vector<int> &v=queue.front();
        if (v[0]==n && v[1]==n){
            cout<<"Yes"<<endl;
            return 0;
        }
        if (foot[v[0]][v[1]][v[3]]>=v[2]) continue;
        foot[v[0]][v[1]][v[3]]=v[2];
        
        v[2]-=map[v[0]][v[1]];
        if (v[2]<=0) continue;
        if (!v[3] && v[0]==ox && v[1]==oy){
            v[3]=1;
            v[2]*=2;
        }
        if (1<v[0]) if (foot[v[0]-1][v[1]][v[3]]<v[2]) 
            queue.push_back(vector<int>{v[0]-1,v[1],v[2],v[3]});
        if (1<v[1]) if (foot[v[0]][v[1]-1][v[3]]<v[2]) 
             queue.push_back(vector<int>{v[0],v[1]-1,v[2],v[3]});
        if (v[0]<n) if (foot[v[0]+1][v[1]][v[3]]<v[2]) 
             queue.push_back(vector<int>{v[0]+1,v[1],v[2],v[3]});
        if (v[1]<n) if (foot[v[0]][v[1]+1][v[3]]<v[2]) 
             queue.push_back(vector<int>{v[0],v[1]+1,v[2],v[3]});
        
        //queue.sort([](vector<int> &le,vector<int> &re){return le[0]+le[1]>re[0]+re[1];});
    }
    
    cout<<"No"<<endl;
    
    return 0;
}