import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N, V, SX, SY, TX, TY;
int[][] L;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      V = readInt();
      SY = readInt() - 1;
      SX = readInt() - 1;
      TY = readInt() - 1;
      TX = readInt() - 1;
      L = new int[][](N, N);
      foreach (x; 0 .. N) foreach (y; 0 .. N) {
        L[x][y] = readInt();
      }
      
      auto dp = new int[][](N, N);
      foreach (x; 0 .. N) foreach (y; 0 .. N) {
        dp[x][y] = V + 1;
      }
      dp[TX][TY] = 1;
      int ans = -1;
      foreach (c; 0 .. N * N) {
        debug {
          if (N <= 4) {
            writeln(dp);
          }
        }
        if (dp[SX][SY] <= V) {
          ans = c;
          break;
        }
        auto dpNext = new int[][](N, N);
        foreach (x; 0 .. N) foreach (y; 0 .. N) {
          dpNext[x][y] = V + 1;
          void update(int xx, int yy) {
            chmin(dpNext[x][y], L[xx][yy] + dp[xx][yy]);
          }
          if (x + 1 < N) update(x + 1, y);
          if (y + 1 < N) update(x, y + 1);
          if (x > 0) update(x - 1, y);
          if (y > 0) update(x, y - 1);
        }
        dp = dpNext;
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}