import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum INF = 10^^9;

int N, V, OX, OY;
int[][] L;

int[][] dijkstra(int sx, int sy) {
  alias Node = Tuple!(int, "c", int, "x", int, "y");
  auto q = BinaryHeap!(Array!Node, "a.c > b.c")();
  auto d = new int[][](N, N);
  foreach (x; 0 .. N) foreach (y; 0 .. N) {
    d[x][y] = INF;
  }
  d[sx][sy] = 0;
  q.insert(Node(0, sx, sy));
  for (; !q.empty; ) {
    const c = q.front.c;
    const x = q.front.x;
    const y = q.front.y;
    q.removeFront;
    if (d[x][y] == c) {
      foreach (dir; 0 .. 4) {
        const xx = x + [+1, 0, -1, 0][dir];
        const yy = y + [0, +1, 0, -1][dir];
        if (0 <= xx && xx < N && 0 <= yy && yy < N) {
          const cc = c + L[xx][yy];
          if (d[xx][yy] > cc) {
            d[xx][yy] = cc;
            q.insert(Node(cc, xx, yy));
          }
        }
      }
    }
  }
  return d;
}

void main() {
  try {
    for (; ; ) {
      N = readInt();
      V = readInt();
      OY = readInt() - 1;
      OX = readInt() - 1;
      L = new int[][](N, N);
      foreach (x; 0 .. N) foreach (y; 0 .. N) {
        L[x][y] = readInt();
      }
      
      bool ans;
      auto d0 = dijkstra(0, 0);
      if (V - d0[N - 1][N - 1] > 0) {
        ans = true;
      }
      if (OX != -1) {
        auto d1 = dijkstra(OX, OY);
        if (V - d0[OX][OY] > 0 && (V - d0[OX][OY]) * 2 - d1[N - 1][N - 1] > 0) {
          ans = true;
        }
      }
      writeln(ans ? "YES" : "NO");
    }
  } catch (EOFException e) {
  }
}