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

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)

void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(int *x, int *y){reader(x);reader(y);}
void reader(int *x, int *y, int *z){reader(x);reader(y);reader(z);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}

template <class T>
struct DijkstraHeap {
  int *hp, *place, size; char *visited; T *val;

  void malloc(int N){hp=(int*)std::malloc(N*sizeof(int));place=(int*)std::malloc(N*sizeof(int));visited=(char*)std::malloc(N*sizeof(char));val=(T*)std::malloc(N*sizeof(T));}
  void free(){free(hp);free(place);free(visited);free(val);}
  void* malloc(int N, void *workMemory){hp=(int*)workMemory;place=(int*)(hp+N);visited=(char*)(place+N);val=(T*)(visited+N);workMemory=(void*)(val+N);return workMemory;}
  void init(int N){int i;size=0;rep(i,N)place[i]=-1,visited[i]=0;}
  void up(int n){int m;while(n){m=(n-1)/2;if(val[hp[m]]<=val[hp[n]])break;swap(hp[m],hp[n]);swap(place[hp[m]],place[hp[n]]);n=m;}}
  void down(int n){int m;for(;;){m=2*n+1;if(m>=size)break;if(m+1<size&&val[hp[m]]>val[hp[m+1]])m++;if(val[hp[m]]>=val[hp[n]]) break;swap(hp[m],hp[n]);swap(place[hp[m]],place[hp[n]]);n=m;}}
  void change(int n, T v){if(visited[n]||(place[n]>=0&&val[n]<=v))return;val[n]=v;if(place[n]==-1)place[n]=size,hp[size++]=n,up(place[n]);else up(place[n]);}
  int pop(void){int res=hp[0];place[res]=-1;size--;if(size)hp[0]=hp[size],place[hp[0]]=0,down(0);visited[res]=1;return res;}
};

int N, V, Ox, Oy, mp[555][555];
int d1[555][555], d2[555][555];

int main(){
  int i, j, k;
  int di[4]={-1,1,0,0}, dj[4]={0,0,-1,1}, d, ni, nj;
  DijkstraHeap<int> hp;

  reader(&N,&V);
  reader(&Oy,&Ox); Ox--; Oy--;
  rep(i,N) rep(j,N) reader(mp[i]+j);

  hp.malloc(N*N);

  hp.init(N*N);
  hp.change(0, 0);
  while(hp.size){
    k = hp.pop();
    i = k / N; j = k % N;
    rep(d,4){
      ni = i + di[d];
      nj = j + dj[d];
      if(ni < 0 || nj < 0 || ni >= N || nj >= N) continue;
      hp.change(ni*N+nj, hp.val[k]+mp[ni][nj]);
    }
  }
  rep(i,N) rep(j,N) d1[i][j] = hp.val[i*N+j];

  if(d1[N-1][N-1] < V){ writer("YES\n"); return 0; }
  if(Ox < 0){ writer("NO\n"); return 0; }

  hp.init(N*N);
  hp.change(Ox*N+Oy, 0);
  while(hp.size){
    k = hp.pop();
    i = k / N; j = k % N;
    rep(d,4){
      ni = i + di[d];
      nj = j + dj[d];
      if(ni < 0 || nj < 0 || ni >= N || nj >= N) continue;
      hp.change(ni*N+nj, hp.val[k]+mp[ni][nj]);
    }
  }
  rep(i,N) rep(j,N) d2[i][j] = hp.val[i*N+j];

  if((V-d1[Ox][Oy])*2-d2[N-1][N-1] <= 0) writer("NO\n"); else writer("YES\n");

  return 0;
}