#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int N, V, Sx, Sy, Gx, Gy;
	while(cin >> N >> V >> Sx >> Sy >> Gx >> Gy) {
		-- Sx, -- Sy, -- Gx, -- Gy;
		vector<vi> L(N, vi(N));
		rep(i, N) rep(j, N) cin >> L[i][j];
		vector<vi> dp(N, vi(N, -1)), ndp = dp;
		int ans = INF;
		ndp[Sy][Sx] = V;
		rep(m, N * N) {
			dp = ndp;
			if(dp[Gy][Gx] != -1) {
				ans = m;
				break;
			}
			rep(i, N) rep(j, N) {
				int x = dp[i][j];
				if(x == -1) continue;
				static const int dy[4] = {0,1,0,-1}, dx[4] = {1,0,-1,0};
				rep(d, 4) {
					int yy = i + dy[d], xx = j + dx[d];
					if(yy<0||yy>=N||xx<0||xx>=N) continue;
					int nx = x - L[yy][xx];
					if(nx <= 0) continue;
					amax(ndp[yy][xx], nx);
				}
			}
		}
		printf("%d\n", ans == INF ? -1 : ans);
	}
	return 0;
}