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

#define _p(...) (void)printf(__VA_ARGS__)
#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define ALL(x) (x).begin(), (x).end()
#define BIT(n) (1LL<<(n))
#define SZ(x) ((int)(x).size())
#define fst first
#define snd second
#define Y first
#define X second
typedef vector<int> vi;typedef vector<vi> vvi;typedef pair<int,int> pii;typedef vector<pii> vpii;
typedef long long ll;

int DY[4] = {1, 0, -1, 0};
int DX[4] = {0, 1, 0, -1};
template<typename T> inline bool inside(T y, T x, T h, T w) { return 0 <= y && y < h && 0 <= x && x < w; };

int N, V, OX, OY;
vvi L;

vvi dijkstra(int sy, int sx) {
  priority_queue<pair<int, pii>, vector<pair<int, pii>>, greater<pair<int, pii>> > q;
  vvi D(N, vi(N, 1e9));
  D[0][0] = 0;
  q.push({0, {sy, sx}});

  while (!q.empty()) {
    int c = q.top().first;
    int y = q.top().snd.fst;
    int x = q.top().snd.snd;
    q.pop();

    if (D[y][x] < c) continue;

    rep(i, 4) {
      int ny = y + DY[i];
      int nx = x + DX[i];
      if (!inside(ny, nx, N, N)) continue;  // 範囲外
      int nc = c + L[ny][nx];
      if (D[ny][nx] > nc) {
        D[ny][nx] = nc;
        q.push({nc, {ny, nx}});
      }
    }
  }
  return D;
}

void Main() {
  scanf("%d%d%d%d", &N, &V, &OX, &OY);
  OX--; OY--;

  L.resize(N, vi(N));
  rep(y, N) rep(x, N) scanf("%d", &L[y][x]);

  vvi D1 = dijkstra(0, 0);
  if (D1[N-1][N-1] < V) {
    puts("YES");
    return;
  }
  else if (OX >= 0 && OY >= 0 && D1[OY][OX] < V) {
    vvi D2 = dijkstra(OY, OX);
    V = (V - D1[OY][OX]) * 2;
    if (D2[N-1][N-1] < V) {
      puts("YES");
      return;
    }
  }

  puts("NO");
}
int main() { cin.tie(0); ios::sync_with_stdio(false); Main(); return 0; }