#include<bits/stdc++.h>
using namespace std;
#define inf INT_MAX
#define INF LLONG_MAX
#define ll long long
#define ull unsigned long long
#define M (int)(1e9+7)
#define P pair<int,int>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n,0)
#define all(a) a.begin(),a.end()
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
#define F first
#define S second
#define PB push_back
#define EB emplace_back
#define int ll
#define vi vector<int>
#define IP pair<int,P>
#define PI pair<P,int>
#define PP pair<P,P>
#define Yes(f){cout<<(f?"Yes":"No")<<endl;}
#define YES(f){cout<<(f?"YES":"NO")<<endl;}
#define MPlus(x,y) {x=(x+y)%M;}
#define MSub(x,y) {x=(x-y+M)%M;}
#define MMul(x,y) {x=(x*y)%M;}

int n,v,sx,sy,gx,gy;
int d[110][110];
int dp[100][100];

signed main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(20);

  
  cin>>n>>v>>sx>>sy>>gx>>gy;
  sx--;sy--;gx--;gy--;
  
  rep(i,n){
    rep(j,n){
      cin>>d[i][j];
    }
  }
  map<P,int> dp[110000];
  dp[v][P(sx,sy)]=0;
  queue<P> vec[v+1];
  vec[v].push(P(sx,sy));

  rrep(k,v){
    while(vec[k].size()){
      P p=vec[k].front(); vec[k].pop();
      //cout<<p.F<<' '<<p.S<<endl;
      rep(l,4){
        int x=p.F+vx[l];
        int y=p.S+vy[l];
        //cout<<' '<<x<<' '<<y<<endl;
        if(!(0<=x&&x<n&&0<=y&&y<n)) continue;
        if(k-d[y][x]<=0) continue;
        
        if(dp[k-d[y][x]].find(P(x,y))==dp[k-d[y][x]].end()||dp[k-d[y][x]][P(x,y)]>dp[k][p]+1){
          dp[k-d[y][x]][P(x,y)]=dp[k][p]+1;
          vec[k-d[y][x]].push(P(x,y));
        }
      }
    }
  }

  int ans=inf;
  FOR(i,1,v+1){
    if(dp[i].find(P(gx,gy))==dp[i].end()) continue;
    ans=min(ans,dp[i][P(gx,gy)]);
  }

  cout<<(ans==inf?-1:ans)<<endl;
  
}