import java.io.IOException; import java.util.InputMismatchException; import java.util.PriorityQueue; public class Main { int n; int[][] f; class Point implements Comparable { int x, y; int min; Point(int x, int y, int min) { this.x = x; this.y = y; this.min = min; } @Override public int compareTo(Point o) { if (this.min != o.min) { return this.min - o.min; } if (this.x != o.x) { return this.x - o.x; } if (this.y != o.y) { return this.y - o.y; } return 0; } } int bfs(int sx, int sy, int gx, int gy) { PriorityQueue queue = new PriorityQueue(); queue.add(new Point(0, 0, 0)); int[] dx = { -1, 0, 0, 1 }; int[] dy = { 0, -1, 1, 0 }; boolean[][] vis = new boolean[n][n]; while (!queue.isEmpty()) { Point p = queue.poll(); int x = p.x; int y = p.y; int min = p.min; if (x == gx && y == gy) { return min; } if (vis[y][x]) { continue; } vis[y][x] = true; for (int i = 0; i < 4; i++) { int nx = x + dx[i]; int ny = y + dy[i]; if (nx < 0 || n <= nx || ny < 0 || n <= ny) continue; queue.add(new Point(nx, ny, min + f[ny][nx])); } } return -1; } void run() { MyScanner sc = new MyScanner(); n = sc.nextInt(); int v = sc.nextInt(); int ox = sc.nextInt() - 1; int oy = sc.nextInt() - 1; f = new int[n][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { f[i][j] = sc.nextInt(); } } int a = bfs(0, 0, n - 1, n - 1); int b = bfs(0, 0, ox, oy); int c = bfs(ox, oy, n - 1, n - 1); if (a < v) { System.out.println("YES"); } else if (ox != 0 || oy != 0) { int nv = (v-b)*2; if (c < nv) { System.out.println("YES"); } else { System.out.println("NO"); } } else { System.out.println("NO"); } } public static void main(String[] args) { new Main().run(); } public void mapDebug(int[][] a) { System.out.println("--------map display---------"); for (int i = 0; i < a.length; i++) { for (int j = 0; j < a[i].length; j++) { System.out.printf("%3d ", a[i][j]); } System.out.println(); } System.out.println("----------------------------" + '\n'); } class MyScanner { int read() { try { return System.in.read(); } catch (IOException e) { throw new InputMismatchException(); } } boolean isSpaceChar(int c) { return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; } boolean isEndline(int c) { return c == '\n' || c == '\r' || c == -1; } int nextInt() { return Integer.parseInt(next()); } int[] nextIntArray(int n) { int[] array = new int[n]; for (int i = 0; i < n; i++) array[i] = nextInt(); return array; } long nextLong() { return Long.parseLong(next()); } long[] nextLongArray(int n) { long[] array = new long[n]; for (int i = 0; i < n; i++) array[i] = nextLong(); return array; } double nextDouble() { return Double.parseDouble(next()); } double[] nextDoubleArray(int n) { double[] array = new double[n]; for (int i = 0; i < n; i++) array[i] = nextDouble(); return array; } String next() { int c = read(); while (isSpaceChar(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isSpaceChar(c)); return res.toString(); } String[] nextStringArray(int n) { String[] array = new String[n]; for (int i = 0; i < n; i++) array[i] = next(); return array; } String nextLine() { int c = read(); while (isEndline(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isEndline(c)); return res.toString(); } } }