#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;

int n,v,ox,oy;
int l[210][210];
vector<vector<P>> G;

template <typename T>
vector<T> dijkstra(int s,vector<vector<pair<T,int>>> & G){
    const T inf=numeric_limits<T>::max();
    using edge=pair<T,int>;
    priority_queue<edge, vector<edge>, greater<edge> > que;
    int n=G.size();
    vector<T> d(n,inf);
    vector<int> b(n,-1);
    d[s]=0;
    que.emplace(d[s],s);
    while (!que.empty()){
        edge p = que.top(); que.pop();
        //cout << p.first << endl;
        int v = p.second;
        if (d[v]<p.first) continue;
        for(auto& e:G[v]){
            int u=e.second;
            T c=e.first;
            if (d[u]>d[v]+c){
                d[u]=d[v]+c;
                b[u]=v;
                que.emplace(d[u],u);
            }
        }
    }
    return d;
}


void solve(){
  cin >> n >> v >> ox >> oy;
  ox--;oy--;
  G.resize(n*n,{});
  rep(i,n){
    rep(j,n){
      cin >> l[i][j];
    }
  }
  rep(i,n){
    rep(j,n){
      if (i>=1) G[(i-1)*n+j].push_back(P(l[i][j],i*n+j));
      if (i<=n-2) G[(i+1)*n+j].push_back(P(l[i][j],i*n+j));
      if (j>=1) G[i*n+j-1].push_back(P(l[i][j],i*n+j));
      if (j<=n-2) G[i*n+j+1].push_back(P(l[i][j],i*n+j));
    }
  }
  
  vector<int> d1=dijkstra(0,G);
  int ans=0;
  ans=d1[n*(n-1)+n-1];
  //cout << ans << endl;
  if (ans<v) {
    cout << "YES" << endl;
    return;
  }
  else if(ox==-1) {
    cout << "NO" << endl; 
    return;
  }
  
  vector<int> d2=dijkstra(oy*n+ox,G);
  ans=d1[ox*n+oy];
  if (ans>=v) {
    cout << "NO" << endl;
    return;
  }
  v=2*(v-ans);
  ans=d2[n*(n-1)+n-1];
  if (ans<v) {
    cout << "YES" << endl;
    return;
  }
  cout << "NO" << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}