// includes
#include <cassert>
#include <cstdio>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
#include <list>
#include <random>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}

int l[101][101];
int n, V, sx, sy, gx, gy;

struct point{
  int i, j, v;
  point(){}
  point(int i, int j, int v): i(i), j(j), v(v){}
};

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

int dis[101][101][10001];
int maxi[101][101];

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> V >> sx >> sy >> gx >> gy, sx--, sy--, gx--, gy--;
  rep(i, n){
    rep(j, n)cin >> l[i][j];
  }
  swap(sx, sy);
  swap(gx, gy);
  rep(i, n){
    rep(j, n){
      rep(k, V+1){
        dis[i][j][k] = inf;
      }
    }
  }
  dis[sx][sy][V] = 0;
  queue<point> q;
  q.push(point(sx, sy, V));
  while(!q.empty()){
    point p = q.front(); q.pop();
    //cerr << p.i << " " << p.j << " " << p.v << endl;
    if(maxi[p.i][p.j] > p.v)continue;
    maxi[p.i][p.j] = p.v;
    if(p.i == gx && p.j == gy)break;
    rep(k, 4){
      int nx = p.i + dx[k];
      int ny = p.j + dy[k];
      //cerr << nx << " " << ny << endl;
      if(nx >= 0 && nx < n && ny >= 0 && ny < n){
        if(p.v > l[nx][ny] && maxi[nx][ny] < p.v - l[nx][ny]){
          maxi[nx][ny] = p.v - l[nx][ny];
          dis[nx][ny][p.v - l[nx][ny]] = dis[p.i][p.j][p.v] + 1;
          q.push(point(nx, ny, p.v - l[nx][ny]));
        }
      }
    }
  }
//   rep(i, n){
//     rep(j, n)cout << maxi[i][j] << "\n "[j + 1 != n];
//   }
  int res = inf;
  rep(i, V+1){
    res = min(res, dis[gx][gy][i]);
  }
  if(res != inf)cout << res << endl;
  else cout << -1 << endl;
	return 0;
}