import java.math.*;
import java.util.*;

public class Main {
	class pair{
		int num;
		int cost;
		pair(int num,int cost){
			this.num=num;
			this.cost=cost;
		}
	}
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int v = sc.nextInt();
        int sx = sc.nextInt()-1;
        int sy=sc.nextInt()-1;
        int gx=sc.nextInt()-1;
        int gy=sc.nextInt()-1;
        int[][] map = new int[n][n];
        for(int i=0;i<n;i++){
        	for(int j=0;j<n;j++){
        		map[i][j]=sc.nextInt();
        	}
        }
        int[] dx = {1,0,-1,0};
        int[] dy = {0,1,0,-1};
        
        int[][] totalcost = new int[n][n];
        for(int i=0;i<n;i++) Arrays.fill(totalcost[i], 1000000);
        Queue<Integer> queuex = new LinkedList<Integer>();
        Queue<Integer> queuey = new LinkedList<Integer>();
        Queue<Integer> hosuu = new LinkedList<Integer>();
		totalcost[sy][sx]=0;
        queuex.offer(sx);
        queuey.offer(sy);
        hosuu.offer(0);
        while(!queuex.isEmpty()){
        	int nx = queuex.poll();
        	int ny = queuey.poll();
        	int nh = hosuu.poll();
        	if(nx==gx && ny == gy){
        		System.out.println(nh);
        		return;
        	}
        	for(int i=0;i<4;i++){
        		if(nx+dx[i]>=0 && nx+dx[i]<n && ny+dy[i]>=0 && ny+dy[i]<n &&totalcost[ny][nx]+map[ny+dy[i]][nx+dx[i]]<v&& totalcost[ny][nx]+map[ny+dy[i]][nx+dx[i]]<totalcost[ny+dy[i]][nx+dx[i]]){
        			queuex.offer(nx+dx[i]);
        			queuey.offer(ny+dy[i]);
        			hosuu.offer(nh+1);
        			totalcost[ny+dy[i]][nx+dx[i]]=totalcost[ny][nx]+map[ny+dy[i]][nx+dx[i]];
        		}
        	}
        }
        System.err.println(-1);
    }
}