import java.util.*;
import java.io.*;

public class Main {
    
    static NODE[][] nodes;
    
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());
        int N=Integer.parseInt(st.nextToken());
        int V=Integer.parseInt(st.nextToken());
        int Ox=Integer.parseInt(st.nextToken());
        int Oy=Integer.parseInt(st.nextToken());
        PriorityQueue<NODE> pq=new PriorityQueue<>(new MyComparator());
        nodes=new NODE[N][N];
        for(int i=0;i<N;i++){
            st=new StringTokenizer(br.readLine());
            for(int j=0;j<N;j++){
                nodes[i][j]=new NODE();
                nodes[i][j].x=i; nodes[i][j].y=j;
                nodes[i][j].level=Integer.parseInt(st.nextToken());
                nodes[i][j].dist=-1;
            }
        }nodes[0][0].dist=0;
        pq.offer(nodes[0][0]);
        NODE node;
        while(!pq.isEmpty()){
            node=pq.poll();
            //System.out.println(node.x+" "+node.y);
            if(node.x>0){ update(pq,node,node.x-1,node.y); }
            if(node.x<N-1){ update(pq,node,node.x+1,node.y); }
            if(node.y>0){ update(pq,node,node.x,node.y-1); }
            if(node.y<N-1){ update(pq,node,node.x,node.y+1); }
        }int start_to_end=V-nodes[N-1][N-1].dist;
        if(Ox==0&&Oy==0){ System.out.println((start_to_end>0) ? "YES":"NO"); }
        else{
            int start_to_O=V-nodes[Ox-1][Oy-1].dist;
            if(start_to_O<=0){
                System.out.println("NO");
                System.exit(0);
            }else{ start_to_O*=2; }
            for(int i=0;i<N;i++){
                for(int j=0;j<N;j++){
                    nodes[i][j].dist=-1;
                }
            }
            nodes[Ox-1][Oy-1].dist=0;
            pq.offer(nodes[Ox-1][Oy-1]);
            while(!pq.isEmpty()){
                node=pq.poll();
                //System.out.println(node.x+" "+node.y);
                if(node.x>0){ update(pq,node,node.x-1,node.y); }
                if(node.x<N-1){ update(pq,node,node.x+1,node.y); }
                if(node.y>0){ update(pq,node,node.x,node.y-1); }
                if(node.y<N-1){ update(pq,node,node.x,node.y+1); }
            }int O_to_end=start_to_O-nodes[N-1][N-1].dist;
            System.out.println((O_to_end>0) ? "YES":"NO");
        }
    }
    
    static void update(PriorityQueue<NODE> pq,NODE node,int x,int y){
        if(nodes[x][y].dist==-1 || nodes[x][y].dist>node.dist+nodes[x][y].level){
            nodes[x][y].dist=nodes[x][y].level+node.dist;
            if(!pq.contains(nodes[x][y])){ pq.offer(nodes[x][y]); }
        }
    }

}

class MyComparator implements Comparator{
    public int compare(Object arg0,Object arg1){
        NODE x=(NODE) arg0;
        NODE y=(NODE) arg1;
        if(x.dist<y.dist) return 1;
        else if(x.dist>y.dist) return -1;
        else return 0;
    }
}

class NODE{
    int level,dist,x,y;
}