#include <bits/stdc++.h>
using namespace std;

int main() {
  int N, V, SX, SY, GX, GY;
  cin >> N >> V >> SX >> SY >> GX >> GY;
  SX--, SY--, GX--, GY--;
  V = min(2000, V);
  vector<vector<int>> L(N, vector<int>(N));
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < N; j++) cin >> L.at(i).at(j);
  }
  
  vector dist(N, vector(N, vector(V + 1, INT_MAX)));
  dist.at(SY).at(SX).at(V) = 0;
  
  vector mx {-1, 0, 1, 0};
  vector my {0, 1, 0, -1};

  using t4 = tuple<int, int, int, int>;
  priority_queue<t4, vector<t4>, greater<t4>> PQ;
  PQ.push({0, SY, SX, V});

  while (PQ.size()) {
    auto [d, y, x, v] = PQ.top();
    PQ.pop();
    if (d > dist.at(y).at(x).at(v)) continue;
    for (int i = 0; i < 4; i++) {
      int ny = y + my.at(i);
      int nx = x + mx.at(i);
      if (ny < 0 || ny >= N || nx < 0 || nx >= N) continue;
      int nv = v - L.at(ny).at(nx);
      if (nv <= 0) continue;
      int nd = d + 1;
      if (nd > dist.at(ny).at(nx).at(nv)) continue;
      if (ny == GY && nx == GX) return cout << nd << "\n", 0;
      dist.at(ny).at(nx).at(nv) = dist.at(y).at(x).at(v) + 1;
      PQ.push({nd, ny, nx, nv});
    }
  }
  cout << -1 << "\n";
}