import java.io.BufferedReader; import java.io.Closeable; import java.io.IOException; import java.io.InputStream; import java.io.InputStreamReader; import java.util.Arrays; import java.util.HashSet; import java.util.LinkedList; import java.util.Scanner; import java.util.Set; import java.util.StringTokenizer; public class Main { public static final int[][] move_dir = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; public static void main(String[] args) throws IOException { Scanner sc = new Scanner(System.in); final int N = sc.nextInt(); final int V = sc.nextInt(); final int Sx = sc.nextInt() - 1; final int Sy = sc.nextInt() - 1; final int Gx = sc.nextInt() - 1; final int Gy = sc.nextInt() - 1; int[][] damage = new int[N][N]; for(int i = 0; i < N; i++){ for(int j = 0; j < N; j++){ damage[i][j] = sc.nextInt(); } } int[][][] min_steps = new int[N][N][V + 1]; for(int i = 0; i < N; i++){ for(int j = 0; j < N; j++){ Arrays.fill(min_steps[i][j], Integer.MAX_VALUE); } } LinkedList x_queue = new LinkedList(); LinkedList y_queue = new LinkedList(); LinkedList hp_queue = new LinkedList(); min_steps[Sy][Sx][V] = 0; x_queue.add(Sx); y_queue.add(Sy); hp_queue.add(V); while(!hp_queue.isEmpty()){ final int x = x_queue.poll(); final int y = y_queue.poll(); final int hp = hp_queue.poll(); if(x == Gx && y == Gy){ System.out.println(min_steps[y][x][hp]); return; } for(final 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 next_hp = hp - damage[ny][nx]; if(next_hp <= 0){ continue; } final int next_step = min_steps[y][x][hp] + 1; if(next_step < min_steps[ny][nx][next_hp]){ min_steps[ny][nx][next_hp] = next_step; x_queue.add(nx); y_queue.add(ny); hp_queue.add(next_hp); } } } System.out.println(-1); } public static class Scanner implements Closeable { private BufferedReader br; private StringTokenizer tok; public Scanner(InputStream is) throws IOException { br = new BufferedReader(new InputStreamReader(is)); } private void getLine() throws IOException { while (!hasNext()) { tok = new StringTokenizer(br.readLine()); } } private boolean hasNext() { return tok != null && tok.hasMoreTokens(); } public String next() throws IOException { getLine(); return tok.nextToken(); } public int nextInt() throws IOException { return Integer.parseInt(next()); } public long nextLong() throws IOException { return Long.parseLong(next()); } public void close() throws IOException { br.close(); } } }