import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int v = sc.nextInt();
        int s = sc.nextInt() - 1 + (sc.nextInt() - 1) * n;
        int t = sc.nextInt() - 1 + (sc.nextInt() - 1) * n;
        v = Math.min(v, (Math.abs(s % n - t % n) + Math.abs(s / n - t / n)) * 9);
        int[] field = new int[n * n];
        for (int i = 0; i < n * n; i++) {
            field[i] = sc.nextInt();
        }
        int[][] costs = new int[n * n][v + 1];
        for (int[] arr : costs) {
            Arrays.fill(arr, Integer.MAX_VALUE);
        }
        PriorityQueue<Path> queue = new PriorityQueue<>();
        queue.add(new Path(s, 0, v + field[s]));
        while (queue.size() > 0) {
            Path p = queue.poll();
            p.helth -= field[p.idx];
            if (p.helth <= 0 || costs[p.idx][p.helth] <= p.value) {
                continue;
            }
            costs[p.idx][p.helth] = p.value;
            if (p.idx % n > 0) {
                queue.add(new Path(p.idx - 1, p.value + 1, p.helth));
            }
            if (p.idx % n < n - 1) {
                queue.add(new Path(p.idx + 1, p.value + 1, p.helth));
            }
            if (p.idx / n > 0) {
                queue.add(new Path(p.idx - n, p.value + 1, p.helth));
            }
            if (p.idx / n < n - 1) {
                queue.add(new Path(p.idx + n, p.value + 1, p.helth));
            }
        }
        int min = Integer.MAX_VALUE;
        for (int x : costs[t]) {
            min = Math.min(min, x);
        }
        if (min == Integer.MAX_VALUE) {
            System.out.println(-1);
        } else {
            System.out.println(min);
        }
     }
     
     static class Path implements Comparable<Path> {
         int idx;
         int value;
         int helth;
         
         public Path(int idx, int value, int helth) {
             this.idx = idx;
             this.value = value;
             this.helth = helth;
         }
         
         public int compareTo(Path another) {
             return value - another.value;
         }
     }
}