#include <bits/stdc++.h>
#include <atcoder/all>
#include <boost/polygon/point_data.hpp>
#include <boost/polygon/voronoi.hpp>
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(x) begin(x),end(x)
#define sz(x) (int)(x).size()
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
using vll=vector<ll>;
using vvll=vector<vll>;
using vi=vector<int>;
using vvi=vector<vi>;
using pll=pair<ll,ll>;
using pi=pair<int,int>;

// using mint=modint998244353;

// using BoostPoint=boost::polygon::point_data<int>;
// using Voronoi=boost::polygon::voronoi_diagram<double>;

int main()
{
  	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n,v,sx,sy,gx,gy;
	cin>>n>>v>>sx>>sy>>gx>>gy;
	--sx,--sy,--gx,--gy;
	vvi L(n,vi(n));
	rep(i,0,n)rep(j,0,n)cin>>L[j][i];

	int d=abs(sx-gx)+abs(sy-gy);
	if(v>9*d){
		cout<<d<<'\n';
		return 0;
	}

	vvi best(n,vi(n,v));
	best[sx][sy]=0;
	queue<tuple<int,int,int>> q;
	q.push({sx,sy,0});

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

	while(!q.empty()){
		auto [x,y,t]=q.front();
		q.pop();
		if(x==gx&&y==gy){
			cout<<t<<'\n';
			return 0;
		}
		rep(i,0,4){
			int nx=x+dx[i],ny=y+dy[i];
			if(nx<0||nx>=n||ny<0||ny>=n)continue;
			int cost=best[x][y]+L[nx][ny];
			if(cost<best[nx][ny]){
				best[nx][ny]=cost;
				q.push({nx,ny,t+1});
			}
		}
	}
	cout<<-1<<'\n';

}