#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

ll nums[210][210];
ll cost[210][210];
int N,V,Ox,Oy;
ll Dijkstra(pair <int,int> start,pair <int,int> goal){
  priority_queue<pair <ll,pair <int,int> >,vector <pair <ll,pair <int,int> > >,greater<pair <ll,pair <int,int> > > > que;
  rep(i,210){
    rep(j,210){
      cost[i][j] = INF;
    }
  }
  que.push(mp(0,start));
  int dx[] = {0,-1,1,0};
  int dy[] = {-1,0,0,1};
  while(!que.empty()){
    auto x = que.top();que.pop();
    int a = x.sec.fir,b=x.sec.sec;
    int c = x.fir;
    if(cost[a][b] != INF){
      continue;
    }
    cost[a][b] = c;
    if(a == goal.fir && b == goal.sec){
      break;
    }
    rep(i,4){
      int nx = a + dx[i],ny = b + dy[i];
      if(1 <= nx && nx <= N && 1<=ny && ny <= N && cost[nx][ny] == INF){
        que.push(mp(c+nums[nx][ny],mp(nx,ny)));
      }
    }
  }
  return cost[goal.fir][goal.sec];
}
int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> N >> V >> Ox >> Oy;
  rep2(i,1,N+1){
    rep2(j,1,N+1){
      cin >> nums[i][j];
    }
  }
  ll c = Dijkstra(mp(1,1),mp(N,N));
  bool OK = false;
  if(c < V){
    OK = true;
  }
  //DEBUG1(c);
  if(1 <= Ox && Ox <= N && 1 <= Oy && Oy <= N){
    ll c1 = Dijkstra(mp(1,1),mp(Ox,Oy));
    if(c1 < V){
      V -= c1;
      V *= 2;
      ll c2 = Dijkstra(mp(Ox,Oy),mp(N,N));
      if(c2 < V){
        OK = true;
      }
      //DEBUG3(c1,c2,V);
    }
    
  }
  if(OK){
    cout << "YES\n";
  }else{
    cout << "NO\n";
  }
  return 0;
}