#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = (ll)(1e+9) + 7;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
int a[100][100];
int d[100][100];
int cop[100][100];
int n, v, sx, sy, gx, gy;
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
int main() {
	cin >> n >> v >> sy >> sx >> gy >> gx; sx--; sy--; gx--; gy--;
	rep(i, n) {
		rep(j, n) {
			cin >> a[i][j];
			d[i][j] = 10001;
		}
	}
	d[sx][sy] = 0;
	rep1(out, n*n) {
		rep(i, n) {
			rep(j, n) {
				cop[i][j] = d[i][j];
			}
		}
		rep(i, n) {
			rep(j, n) {
				rep(k, 4) {
					int nx = i + dx[k];
					int ny = j + dy[k];
					if (nx < 0 || ny < 0 || nx >= n || ny >= n)continue;
					cop[nx][ny] = min(cop[nx][ny], d[i][j] + a[nx][ny]);
				}
			}
		}
		rep(i, n) {
			rep(j, n) {
				d[i][j] = cop[i][j];
			}
		}
		if (d[gx][gy] < v) {
			cout << out << endl; break;
		}
	}
	if (d[gx][gy] >= v) {
		cout << -1 << endl;
	}
	return 0;
}