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

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define RFOR(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define MP(x,y) make_pair((x), (y))
#define MIN(a,b) (a < b ? a : b)
#define MAX(a,b) (a > b ? a : b)
#define AMIN(a,b) if(b < a) (a) = (b)
#define AMAX(a,b) if(b > a) (a) = (b)
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define bitcount(b) __builtin_popcount(b)
#define GCD(a,b) (__gcd(a,b))
#define GCD3(a,b,c) (GCD(GCD(a,b), c))
#define LCM(a,b) (a/GCD(a,b)*b)
#define LCM3(a,b,c) LCM(LCM(a,b),c)
#define MOD 1000000007
typedef long long ll;
// -------------------------------------

int N, V, Sx, Sy, Gx, Gy;
int L[111][111];

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

int main() {
  cin >> N >> V >> Sx >> Sy >> Gx >> Gy;
  REP(y, N) REP(x, N) cin >> L[x][y];

  map<pair<int, int>, int> fs;
  fs[{Sx-1, Sy-1}] = V;
  vs[Sx-1][Sy-1] = V;

  int ans = 0;
  while (!fs.empty()) {
    map<pair<int, int>, int> ns;
    ITR(s, fs) {
      int x = s->first.first;
      int y = s->first.second;
      int v = s->second;

      if (x == Gx - 1 && y == Gy - 1) {
        cout << ans << endl;
        return 0;
      }
      REP(i, 4) {
        int nx = x + DX[i];
        int ny = y + DY[i];
        if (!(0 <= nx && nx < N)) continue;
        if (!(0 <= ny && ny < N)) continue;
        int nv = v - L[nx][ny];
        if (nv <= vs[nx][ny]) continue;
        vs[nx][ny] = nv;
        ns[{nx, ny}] = nv;
      }
    }
    fs = ns;
    ans++;
  }

  cout << -1 << endl;
  return 0;
}