#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;


#include<cstdint>
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n,v;
    cin>>n>>v;
    vector<vector<vector<__int16_t>>> dp(n,vector<vector<__int16_t>>(n,vector<__int16_t>(v+1,n+n)));
    int si,sj,gi,gj;
    cin>>si>>sj>>gi>>gj;
    si--;sj--;gi--;gj--;
    swap(si,sj);
    swap(gi,gj);
    dp[si][sj][v] = 0;
    vector<pair<pair<int,int>,int>> que;
    int dx[] = {1,-1,0,0};
    int dy[] = {0,0,1,-1};  
    
    vector<vector<int>> a(n,vector<int>(n));
    for(int i = 0;i<n;i++) for(int j = 0;j<n;j++) cin>>a[i][j];

    que.push_back(make_pair(make_pair(si,sj),v));
    for(int i = 0;i<que.size();i++){
        auto now = que[i];
        int ni = que[i].first.first;
        int nj = que[i].first.second;
        if(ni==gi&&gj==nj){
            cout<<dp[ni][nj][que[i].second]<<endl;
            return 0;
        }
        int kk = que[i].second;
        for(int k = 0;k<4;k++){
            int nni = ni + dx[k];
            int nnj = nj + dy[k];
            if(nni<0||nnj<0||nni>=n||nnj>=n) continue;
            int nxt = kk - a[nni][nnj];
            if(nxt<=0) continue;
            if(dp[nni][nnj][nxt]<=dp[ni][nj][kk]+1) continue;
            dp[nni][nnj][nxt] = dp[ni][nj][kk] + 1;
            que.push_back({{nni,nnj},nxt});
        }
    }
    cout<<-1<<endl;
}