import java.io.IOException; import java.util.InputMismatchException; import java.util.LinkedList; import java.util.Queue; public class Main { int n, v; int sx, sy, gx, gy; int[][] g; int max; class D implements Comparable { int x, y; int r; int min; public D(int x, int y, int r, int min) { this.x = x; this.y = y; this.r = r; this.min = min; } @Override public int compareTo(D 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; } if (this.r != o.r) { return this.r - o.r; } return 0; } @Override public String toString() { return "(" + x + ", " + y + ", " + r + ", " + min + ")"; } } int dijkstra() { // PriorityQueue queue = new PriorityQueue(); Queue queue = new LinkedList(); queue.add(new D(sx, sy, v, 0)); boolean[][][] vis = new boolean[n][n][v + 1]; int[] dx = { 0, -1, 1, 0 }; int[] dy = { -1, 0, 0, 1 }; int res = 1 << 25; while (!queue.isEmpty()) { D d = queue.poll(); int x = d.x; int y = d.y; int r = d.r; int min = d.min; if (vis[x][y][r]) { continue; } vis[x][y][r] = true; if (x == gx && y == gy) { res = Math.min(res, min); // return min; } if (res <= min) { continue; } int mhd = Math.abs(gx - x) + Math.abs(gy - y); if (mhd * max < r) { // queue.add(new D(gx, gy, 1, min + mhd)); res = Math.min(res, min + mhd); continue; } 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; } int nr = r - g[ny][nx]; if (nr <= 0) { continue; } int nmin = min + 1; if (!vis[nx][ny][nr]) { queue.add(new D(nx, ny, nr, nmin)); } } } // return -1; return res; } void run() { MyScanner sc = new MyScanner(); n = sc.nextInt(); v = sc.nextInt(); sx = sc.nextInt() - 1; sy = sc.nextInt() - 1; gx = sc.nextInt() - 1; gy = sc.nextInt() - 1; g = new int[n][n]; max = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { g[i][j] = sc.nextInt(); max = Math.max(max, g[i][j]); } } System.out.println(dijkstra()); } 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(); } } }