#include <bits/stdc++.h>

using namespace std;

const int INF = 1<<30;

int dy[] = {0, 1, 0, -1};
int dx[] = {1, 0, -1, 0};

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n, v, sx, sy, gx, gy;
  cin >> n >> v >> sx >> sy >> gx >> gy;
  --sx, --sy;
  --gx, --gy;

  vector<vector<int> > bd(n, vector<int>(n));
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      cin >> bd[i][j];

  vector<vector<map<int, int> > > dist(n, vector<map<int, int> >(n));
  queue<tuple<int, int, int, int> > q;
  q.emplace(sy, sx, v, 0);
  dist[sy][sx][v] = 0;
  
  while (!q.empty()) {
    int y, x, w, d;
    tie(y, x, w, d) = q.front();
    q.pop();

    for (int k = 0; k < 4; k++) {
      int y2 = y + dy[k];
      int x2 = x + dx[k];
      if (y2 < 0 || y2 >= n) continue;
      if (x2 < 0 || x2 >= n) continue;
      int w2 = w - bd[y2][x2];
      if (w2 <= 0) continue;
      if (dist[y2][x2].size() && dist[y2][x2].rbegin()->first >= w2) continue;
      dist[y2][x2][w2] = d + 1;
      q.emplace(y2, x2, w2, d + 1);
    }
  }

  int ret = INF;
  for (auto &[k, v]: dist[gy][gx]) {
    ret = min(ret, v);
  }

  if (ret == INF)
    ret = -1;
  cout << ret << endl;
  
  return 0;
}