#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned long long ULL;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(auto i: c)
#define SORT(c) sort((c).begin(),(c).end())

#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()

const double EPS = 1e-10;
const double PI  = acos(-1.0);

#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;


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

	int N, V, Sx, Sy, Gx, Gy;
	cin >> N >> V >> Sy >> Sx >> Gy >> Gx;
	Sx--;Sy--;Gx--;Gy--;
	const int MAX = 1e9;
	VVI L(N, VI(N)), M(N, VI(N, MAX)), T(N, VI(N, MAX));
	REP(i, N) REP(j, N) cin >> L[i][j];
	M[Sx][Sy] = 0;
	T[Sx][Sy] = 0;

	queue<PII> que;
	que.push(MP(Sx, Sy));

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

	while(!que.empty()){
		int cX, cY, nX, nY;
		cX = que.front().first;
		cY = que.front().second;
		que.pop();
		REP(i, 4){
			nX = cX + dx[i];
			nY = cY + dy[i];
			if((nX < 0) || (N - 1 < nX) || (nY < 0) || (N - 1 < nY)) continue;
			if(M[cX][cY] + L[nX][nY] < M[nX][nY]){
				M[nX][nY] = M[cX][cY] + L[nX][nY];
				que.push(MP(nX, nY));
				T[nX][nY] = T[cX][cY] + 1;
			}
		}
		if(M[Gx][Gy] < V) break;
	}

	if(M[Gx][Gy] >= V) cout << -1 << endl;
	else cout << T[Gx][Gy] << endl;

	return 0;
}