import java.util.Arrays;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.Set;

public class Main {
	
	public static final int[][] move_dir = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		final int N = sc.nextInt();
		final int V = sc.nextInt();
		final int Ox = sc.nextInt() - 1;
		final int Oy = sc.nextInt() - 1;
		
		int[][] Lyx = new int[N][N];
		for(int i = 0; i < N; i++){
			for(int j = 0; j < N; j++){
				Lyx[i][j] = sc.nextInt();
			}
		}
		
		LinkedList<Integer> x_queue = new LinkedList<Integer>();
		LinkedList<Integer> y_queue = new LinkedList<Integer>();
		LinkedList<Integer> hp_queue = new LinkedList<Integer>();
		LinkedList<Integer> oasis_queue = new LinkedList<Integer>();
		boolean[][][][] visited = new boolean[N][N][(V + 1) * 2][2];
		visited[0][0][V][0] = true;
		x_queue.add(0);
		y_queue.add(0);
		hp_queue.add(V);
		oasis_queue.add(0);
		
		boolean ok = false;
		while(!x_queue.isEmpty()){
			final int x = x_queue.poll();
			final int y = y_queue.poll();
			final int hp = hp_queue.poll();
			final int oasis = oasis_queue.poll();
			
			if(x == N - 1 && y == N - 1){
				ok = true;
				break;
			}
			
			for(int[] move : move_dir){
				final int nx = x + move[0];
				final int ny = y + move[1];
				
				if(nx < 0 || nx >= N || ny < 0 || ny >= N){
					continue;
				}
				
				final int n_hp = hp - Lyx[ny][nx];
				if(n_hp <= 0){ continue; }
				
				if(!visited[ny][nx][n_hp][oasis]){
					visited[ny][nx][n_hp][oasis] = true;
					x_queue.add(nx);
					y_queue.add(ny);
					hp_queue.add(n_hp);
					oasis_queue.add(oasis);
				}
				
				if(oasis == 0 && Ox == nx && Oy == ny && !visited[ny][nx][n_hp * 2][1]){
					visited[ny][nx][n_hp * 2][1] = true;
					x_queue.add(nx);
					y_queue.add(ny);
					hp_queue.add(n_hp * 2);
					oasis_queue.add(1);
				}
			}
		}
		
		System.out.println(ok ? "YES" : "NO");
		
	}

}