#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
int dx[]={-1, 0, 1, 0}, dy[]={0, -1, 0, 1};
int main()
{
    int n, v, sx, sy, gx, gy;
    while (cin>>n>>v>>sx>>sy>>gx>>gy) {
        vector<vector<int>> L(n, vector<int>(n));
        for(auto& l: L) for(int& w: l) cin>>w;

        queue<tuple<int, int, int, int>> q;
        vector<vector<int>> a(n, vector<int>(n, v));
        --sx, --sy, --gx, --gy;
        q.emplace(0, 0, sy, sx);
        a[sy][sx]=L[sy][sx];
        int res=-1;
        while (q.size()) {
            int t, p, y, x;
            tie(t, p, y, x)=q.front(); q.pop();
            if (x==gx and y==gy) { res=t; break; }
            for(int i=0;i<4;++i) {
                int nx=x+dx[i], ny=y+dy[i];
                if (nx<0 or nx>=n or ny<0 or ny>=n) continue;
                if (p+L[ny][nx]>=a[ny][nx]) continue;
                a[ny][nx]=p+L[ny][nx];
                q.emplace(t+1, p+L[ny][nx], ny, nx);
            }
        }
        cout<<res<<endl;
    }
}