#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];
bool visit[102][102][10001]={0};
priority_queue<pair<pair<int,int>,pair<int,int> > > pq;


int main(){
    
    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;
    }
    
    pq.push({{0,v},{sx,sy}});
    
    while(pq.size()){
        pair<pair<int,int>,pair<int,int> > p = pq.top();
        pq.pop();
        
        int now_v = p.first.second;
        int now_c = p.first.first;
        int now_x = p.second.first;
        int now_y = p.second.second;
        int af_x,af_y;
        
        
        if(now_v<=0) continue;
        if(visit[now_x][now_y][now_v]) continue;
        
        visit[now_x][now_y][now_v] = true;
        
        if(now_x==gx && now_y==gy){
            printf("%d\n",-now_c);
            return 0;
        }
        
        for(int i=0;i<4;i++){
            
            af_x = now_x + mo[i];
            af_y = now_y + mo[i+1];
            
            pq.push({{now_c-1,now_v-l[af_x][af_y]},{af_x,af_y}});
        }
        
    }
    
    puts("-1");
    
    return 0;
}