#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
using ll = long long;
int n,v,sx,sy,tx,ty;
vector<vector<int>> L;

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

void solve(){
	dp[0][sx][sy] = v;
	for(int i = 0;i<10000;i++){
		for(int j = 0 ;j<n;j++){
			for(int k = 0;k<n;k++){
				for(int l = 0;l<4;l++){
					int nj = j+dx[l];
					int nk = k+dy[l];
					if(nj<0||nj>=n||nk<0||nk>=n)continue;
					dp[i+1][nj][nk] = max(dp[i+1][nj][nk],dp[i][j][k]-L[nj][nk]);
				}
			}
		}
	}
	for(int i = 0;i<10000;i++){
		if(dp[i][tx][ty]){
			cout<<i<<endl;
			return;
		}
	}
	cout<<-1<<endl;

}

signed main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cin >> n >> v >> sx >> sy >> tx >> ty;
	L = vector<vector<int>>(n,vector<int>(n));
	swap(sx,sy);
	swap(tx,ty);
	sx--;
	sy--;
	tx--;
	ty--;
	for(int i = 0 ;i< n;i++){
		for(int j = 0;j<n;j++){
			cin >> L[i][j];
		}
	}
	solve();
}