#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) UB(A,x)-LB(A,x)
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
using mint=modint1000000007;
vector<P>M={P(1,0),P(0,1),P(-1,0),P(0,-1)};
signed main(){
  ll N,V,Ox,Oy;cin>>N>>V>>Oy>>Ox;
  vector<vector<ll>>L(N+2,vector<ll>(N+2,1e18)),X(N+2,vector<ll>(N+2)),Y(N+2,vector<ll>(N+2));
  REP(i,N)REP(j,N)cin>>L[i+1][j+1];X[1][1]=V;queue<P>Q;Q.push(P(1,1));
  while(Q.size()){
    ll x=Q.front().F,y=Q.front().S;Q.pop();
    REP(i,4){
      ll xx=x+M[i].F,yy=y+M[i].S;bool t=0;
      if(L[xx][yy]<X[x][y]){
        if(Ox==xx&&Oy==yy){if(Y[xx][yy]<(X[x][y]-L[xx][yy])*2){Y[xx][yy]=(X[x][y]-L[xx][yy])*2;t=1;}}
        else if(X[xx][yy]<X[x][y]-L[xx][yy]){X[xx][yy]=X[x][y]-L[xx][yy];t=1;}
      }
      if(L[xx][yy]<Y[x][y]&&(Ox!=xx||Oy!=yy)&&Y[xx][yy]<Y[x][y]-L[xx][yy]){Y[xx][yy]=Y[x][y]-L[xx][yy];t=1;}
      if(t)Q.push(P(xx,yy));
    }
  }
  if(X[N][N]+Y[N][N])cout<<"YES"<<endl;else cout<<"NO"<<endl;
  return 0;
}