#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
typedef vector<int> vi;typedef vector<vi> vvi;typedef pair<int,int> pii;typedef vector<pii> vpii;
typedef long long ll;

struct state_t {
  bool use;
  int y, x;
};

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; };

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

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

  vector<vvi> D(2, vvi(N, vi(N)));

  bool found = 0;

  function<void(bool, int, int)> dfs = [&](bool use, int y, int x) {
    if (found) return;
    if (y == N-1 && x == N-1) {
      found = 1;
      return;
    }
    rep(i, 4) {
      int ny = y + DY[i];
      int nx = x + DX[i];
      if (!inside(ny, nx, N, N)) continue;  // 範囲外
      bool nu = use;
      int nv = D[use][y][x] - L[y][x];
      if (!nu && ny == OY && nx == OX) {
        nv *= 2;
        nu = true;
      }
      if (D[nu][ny][nx] < nv && L[ny][nx] < nv) {
        D[nu][ny][nx] = nv;
        dfs(nu, ny, nx);
      }
    }
  };
  D[0][0][0] = V;
  dfs(0, 0, 0);
  puts(found ? "YES" : "NO");
}
int main() { cin.tie(0); ios::sync_with_stdio(false); Main(); return 0; }