#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair< int, int > pii;
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef vector< ll > vl;
typedef vector< vl > vvl;
typedef vector< pii > vp;
typedef vector< vp > vvp;
typedef vector< string > vs;
typedef vector< double > vd;
typedef vector< vd > vvd;

template< class T1, class T2 >
int upmin( T1 &x, T2 v ){
  if( x > v ){
    x = v;
    return 1;
  }
  return 0;
}

template< class T1, class T2 >
int upmax( T1 &x, T2 v ){
  if( x < v ){
    x = v;
    return 1;
  }
  return 0;
}

const int INF = 0x3f3f3f3f;
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };
const string msg[] = { "NO", "YES" };

int N, V, Ox, Oy;
vvi L;

void init(){
  cin >> N >> V >> Oy >> Ox;
  --Ox, --Oy;
  L = vvi( N, vi( N ) );
  for( int i = 0; i < N; ++i )
    for( int j = 0; j < N; ++j )
      cin >> L[ i ][ j ];
}

int dp[ 200 + 1 ][ 200 + 1 ][ 2 ];

int in_range( int n, int x, int y ){
  return 0 <= x and x < n and 0 <= y and y < n;
}

void preprocess(){
  memset( dp, 0xff, sizeof( dp ) );
  priority_queue< tuple< int, int, int, int > > pq;
  pq.emplace( dp[ 0 ][ 0 ][ 0 ] = V, 0, 0, 0 );
  while( not pq.empty() ){
    int v, x, y, t; tie( v, x, y, t ) = pq.top(); pq.pop();
    if( v != dp[ x ][ y ][ t ] ) continue;
    for( int di = 0; di < 4; ++di ){
      int nx = x + dx[ di ];
      int ny = y + dy[ di ];
      if( not in_range( N, nx, ny ) ) continue;
      int nv = v - L[ nx ][ ny ];
      if( nv <= 0 ) continue;
      if( upmax( dp[ nx ][ ny ][ t ], nv ) )
        pq.emplace( nv, nx, ny, t );
      if( nx == Ox and ny == Oy and not t and upmax( dp[ nx ][ ny ][ 1 ], nv * 2 ) )
        pq.emplace( nv * 2, nx, ny, 1 );
    }
  }
}

void solve(){
  cout << msg[ dp[ N - 1 ][ N - 1 ][ 0 ] >= 0 or dp[ N - 1 ][ N - 1 ][ 1 ] >= 0 ] << endl;
}

signed main(){
  ios::sync_with_stdio( 0 );
  init();
  preprocess();
  solve();
  return 0;
}