#include <iostream>
#include <algorithm>
#include <queue>
#include <tuple>
#include <array>
using namespace std;
                            // N  E  S  W
constexpr array<int, 4> dr = {-1, 0, 1, 0},
                        dc = { 0, 1, 0,-1};
constexpr int dr_size = dr.size();

int main(void) {
  int N, V, sr, sc, gr, gc; scanf("%d%d%d%d%d%d", &N, &V, &sc, &sr, &gc, &gr);
  --sr, --sc, --gr, --gc;
  vector<vector<int>> G(N, vector<int>(N, 0)); // G[N][N]
  for(int r=0; r<N; ++r) {
    for(int c=0; c<N; ++c) {
      scanf("%d", &G[r][c]);
    }
  }
  vector<vector<vector<bool>>> seen(N, vector<vector<bool>>(N, vector<bool>(V+1, false))); // seen[N][N][V+1]
  queue<tuple<int, int, int, int>> que;
  // 移動回数, 座標, 残りHP
  que.emplace(0, sr, sc, V);
  int res = -1;
  while(!que.empty()) {
    int step, r, c, v; tie(step, r, c, v) = que.front(); que.pop();
    if(r == gr && c == gc) {
      res = step;
      break;
    }
    for(int i=0; i<dr_size; ++i) {
      int nr = r + dr[i],
          nc = c + dc[i];
      if(!(0 <= nr && nr < N && 0 <= nc && nc < N)) { continue; }
      int nv = v - G[nr][nc];
      if(nv <= 0) { continue; }
      if(seen[nr][nc][nv]) { continue; }
      seen[nr][nc][nv] = true;
      que.emplace(step+1, nr, nc, nv);
    }
  }
  printf("%d\n", res);
  return 0;
}