#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>

using namespace std;
typedef long long ll;

const int DY[4] = {-1, 0, 1, 0};
const int DX[4] = {0, 1, 0, -1};

struct Node {
  int y;
  int x;
  int h;
  int dist;

  Node(int y = -1, int x = -1, int h = -1, int dist = 0) {
    this->y = y;
    this->x = x;
    this->h = h;
    this->dist = dist;
  }

  bool operator>(const Node &n) const {
    return dist > n.dist;
  }
};

int main() {
  int N, V, SX, SY, GX, GY;
  cin >> N >> V >> SX >> SY >> GX >> GY;
  --SY;
  --SX;
  --GY;
  --GX;
  int L[N][N];

  for (int y = 0; y < N; ++y) {
    for (int x = 0; x < N; ++x) {
      cin >> L[y][x];
    }
  }


  queue<Node> que;
  que.push(Node(SY, SX, V));
  int visited[N][N];
  memset(visited, 0, sizeof(visited));
  int ans = INT_MAX;

  while (not que.empty()) {
    Node node = que.front();
    que.pop();

    if (node.y == GY && node.x == GX) {
      ans = min(ans, node.dist);
      continue;
    }

    if (visited[node.y][node.x] >= node.h) continue;
    visited[node.y][node.x] = node.h;

    for (int direct = 0; direct < 4; ++direct) {
      int ny = node.y + DY[direct];
      int nx = node.x + DX[direct];
      if (ny < 0 || N <= ny || nx < 0 || N <= nx) continue;
      int nh = node.h - L[ny][nx];
      if (nh <= 0) continue;

      que.push(Node(ny, nx, nh, node.dist + 1));
    }
  }

  if (ans == INT_MAX) {
    cout << -1 << endl;
  } else {
    cout << ans << endl;
  }

  return 0;
}