#ifdef LOCAL111
#else
	#define NDEBUG
#endif
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { cout << '(' << p.first << ' ' << p.second << ')'; return os; }

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#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(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define RBP(i,a) for(auto& i : a)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
	template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
	#define DEBUG(x) true
	template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
#define rangej(a,b,c) ((a) <= (c) and (c) < (b))
#define rrangej(b,c) rangej(0,b,c)
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;
typedef pair<LL,LL> LP;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);	
}

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

int main()
{
	ios_init();
	int n,v;
	function<bool(int,int)> judge = [&](int x, int y) -> bool {
		return 0 <= x and x < n and 0 <= y and y < n;
	};
	while(cin >> n >> v){
		int sx, sy, gx, gy;
		cin >> sx >> sy >> gx >> gy;
		sx--; sy--; gx--; gy--;
		swap(sx, sy); swap(gx, gy);
		vector<vector<int>> l(n,vector<int>(n));
		REP(i,n) REP(j,n) cin >> l[i][j];
		using T = tuple<int,int,int>;
		queue<T> qu;
		vector<vector<bitset<10000+10>>> used(n,vector<bitset<10000+10>>(n));
		qu.emplace(sx*n+sy,v,0);
		used[sx][sy][v] = true;
		int ans = -1;
		while(!qu.empty()){
			int po, dis, hp;
			tie(po,hp,dis) = qu.front();
			qu.pop();
			int x = po/n;
			int y = po%n;
			DEBUG(dis); DEBUG(x); DEBUG(y); DEBUG(hp);
			if(x == gx and y == gy){
				DEBUG(hp);
				ans = dis;
				break;
			}
			REP(i,4){
				int nx = x+dx[i], ny = y+dy[i];
				int nhp = -1;
				if(judge(nx, ny)) nhp = hp-l[nx][ny];
				if(nhp > 0 and !used[nx][ny][nhp]){
					used[nx][ny][nhp] = true;
					qu.emplace(nx*n+ny,nhp,dis+1);
				}
			}
		}
		cout << ans << endl;
	}
	return 0;
}