#define _USE_MATH_DEFINES
 
#include <iostream>
#include <iomanip>
 
#include <algorithm>
#include <cmath>
 
#include <string>
//#include <array>
#include <list>
#include <queue>
#include <vector>
#include <complex>
#include <set>
#include <map>
 
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(10);//
	
	int N,V,Sx,Sy,Gx,Gy;
	cin>>N>>V>>Sx>>Sy>>Gx>>Gy;
	--Sx;--Sy;--Gx;--Gy;
	int L[100][100];
	rep(i,N)rep(j,N){
		cin>>L[j][i];//[x][y];
	}
	int dp[100][100];
	rep(i,N)rep(j,N){
		dp[i][j] = -1;
	}
	dp[Sx][Sy] = V;
	int dx[4] = {1,0,-1,0};
	int dy[4] = {0,1,0,-1};
	int nx,ny,nv;
	set<PII> sNow,sNext;
	sNow.insert(PII(Sx,Sy));
	PII now;
	int ans = 0;
	while( !sNow.empty() ){
		++ans;
		for(set<PII>::iterator itr = sNow.begin();
			itr != sNow.end();
			++itr)
		{
			now = *itr;
			for(int i=0;i<4;++i){
				nx = now.first  + dx[i];
				ny = now.second + dy[i];
				if( 0<= ny && ny < N && 0<= nx && nx < N){
					nv = dp[now.first][now.second]-L[nx][ny];
					if( nv > 0 && nv > dp[nx][ny] ){
						if(ny==Gy && nx==Gx){
							P(ans);
							return 0;
						}
						dp[nx][ny] = nv;
						sNext.insert( PII(nx,ny) );
					}
				}
			}
		}
		sNow = sNext;
		sNext.clear();
	}
	P(-1);
    return 0;
}