#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll=long long;
using Graph=vector<vector<int>>;
#define MAX 1000000
#define MOD 1000000007
//#define MOD 998244353
#define INF 1000000000
//#define INF 1000000000000000000

int main(){
  int N,V,Ox,Oy;
  cin>>N>>V>>Ox>>Oy;
  vector<vector<int>> L(N,vector<int>(N));
  for(int i=0;i<N;i++){
    for(int j=0;j<N;j++){
      cin>>L[i][j];
    }
  }

  priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
  vector<vector<int>> dist(N,vector<int>(N,INF));
  dist[0][0]=0;
  pq.push(make_pair(dist[0][0],0));
  int di[4]={1,0,-1,0};
  int dj[4]={0,1,0,-1};
  while(!pq.empty()){
    int v=pq.top().second;
    int d=pq.top().first;
    pq.pop();
    int i=v/N;
    int j=v%N;
    if(dist[i][j]<d){
      continue;
    }
    for(int k=0;k<4;k++){
      int ni=i+di[k];
      int nj=j+dj[k];
      if(ni<0||nj<0||ni>=N||nj>=N){
        continue;
      }
      if(dist[ni][nj]>dist[i][j]+L[ni][nj]){
        dist[ni][nj]=dist[i][j]+L[ni][nj];
        pq.push(make_pair(dist[ni][nj],ni*N+nj));
      }
    }
  }
  if(dist[N-1][N-1]<V){
    cout<<"YES"<<endl;
    return 0;
  }
  if(Ox==0&&Oy==0){
    cout<<"NO"<<endl;
    return 0;
  }
  swap(Ox,Oy);
  Ox--;
  Oy--;
  V-=dist[Ox][Oy];
  if(V<=0){
    cout<<"NO"<<endl;
    return 0;
  }
  V*=2;

  for(int i=0;i<N;i++){
    for(int j=0;j<N;j++){
      dist[i][j]=INF;
    }
  }
  dist[Ox][Oy]=0;
  pq.push(make_pair(dist[Ox][Oy],Ox*N+Oy));
  while(!pq.empty()){
    int v=pq.top().second;
    int d=pq.top().first;
    pq.pop();
    int i=v/N;
    int j=v%N;
    if(dist[i][j]<d){
      continue;
    }
    for(int k=0;k<4;k++){
      int ni=i+di[k];
      int nj=j+dj[k];
      if(ni<0||nj<0||ni>=N||nj>=N){
        continue;
      }
      if(dist[ni][nj]>dist[i][j]+L[ni][nj]){
        dist[ni][nj]=dist[i][j]+L[ni][nj];
        pq.push(make_pair(dist[ni][nj],ni*N+nj));
      }
    }
  }
  if(dist[N-1][N-1]<V){
    cout<<"YES"<<endl;
  }else{
    cout<<"NO"<<endl;
  }
}