#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cstring>

typedef long long ll;
using namespace std;

#define mod 1000003
#define INF 10000000
#define LLINF 2000000000000000000LL

#define SIZE 10000

int mo[5] = {0,1,0,-1,0};

int n,v,sx,sy,gx,gy;
int l[102][102];
int dp[10000][102][102]={0};
priority_queue<pair<pair<int,int>,pair<int,int> > > pq;


int main(){
    int af_x,af_y;
    bool f;
    
    scanf("%d%d%d%d%d%d",&n,&v,&sx,&sy,&gx,&gy);
    
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            scanf("%d",&l[j][i]);
        }
    }
    
    for(int i=0;i<=n;i++){
        l[i][0]=INF;
        l[i][n+1]=INF;
        l[0][i]=INF;
        l[n+1][i]=INF;
    }
    
    dp[0][sx][sy] = v;
    
    for(int i=1;i<10000;i++){
        f = false;
        memset(dp[1],0,sizeof(dp[1]));
        
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                
                if(dp[0][i][j]==0) continue;
                
                f = true;
                
                for(int k=0;k<4;k++){
                    af_x = i + mo[k];
                    af_y = j + mo[k+1];
                    dp[1][af_x][af_y]=max(dp[1][af_x][af_y],dp[0][i][j]-l[af_x][af_y]);
                }
                
            }
        }
        
        if(dp[1][gx][gy]>0){
            printf("%d\n",i);
            return 0;
        }
        
        if(!f) break;
        
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                dp[0][i][j]=dp[1][i][j];
            }
        }
        
    }
    
    puts("-1");
    
    return 0;
}