#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll=long long;
void solve(){
    int N,V,Ox,Oy;
    cin>>N>>V>>Oy>>Ox;
    --Ox,--Oy;
    vector<int> L(N*N);
    for(int i=0;i<N*N;++i)cin>>L[i];
    const int oasis=Ox*N+Oy;
    const int START=0;
    const int GOAL=N*N-1;
    vector<unordered_set<int>> g(N*N);
    for(int i=0;i<N*N;++i){
        auto [x,y]=pair(i/N,i%N);
        if(x){
            const int j=i-N;
            g[i].emplace(j);
            g[j].emplace(i);
        }
        if(y){
            const int j=i-1;
            g[i].emplace(j);
            g[j].emplace(i);
        }
    }

    auto dijkstra=[&](ll src){
        const ll INF=1e10+10;
        vector<ll> dist(N*N,INF);
        dist[src]=0;
        priority_queue<ll,vector<ll>,greater<ll>> pq;
        pq.emplace(src);
        const int mask=(1<<20)-1;
        while(!pq.empty()){
            auto s=pq.top(); pq.pop();
            auto [dv,v]=pair(s>>20,s&mask);
            if(dist[v]<dv)continue;
            for(auto&w:g[v]){
                const ll dw=dv+L[w];
                if(dw<dist[w]){
                    dist[w]=dw;
                    pq.emplace((dw<<20)+w);
                }
            }
        }
        return dist;
    };

    auto ANS=[&](bool val){
        if(val)cout<<"YES";
        else cout<<"NO";
    };

    auto dist1=dijkstra(START);
    if(dist1[GOAL]<V)return ANS(1);
    if(Ox==-1)return ANS(0);
    auto dist2=dijkstra(oasis);
    V-=dist1[oasis];V<<=1;
    if(V<=dist2[GOAL])return ANS(0);
    ANS(1);
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    int T=1; //cin>>T;
    while(T--)solve();
    return 0;
}