#include <bits/stdc++.h>
//#include <atcoder/all>
//using namespace atcoder;
const double pi = 3.141592653589793238462643383279;
using namespace std;
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).endf()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).endf(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).endf())
#define SORT(c) sort((c).begin(), (c).endf())

//repetition
//------------------------------------------
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define MOD 1000000007

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
const double EPS = 1e-4, PI = acos(-1);
//ここから編集    
typedef string::const_iterator State;
int grid[110][110];
int dist[110][110][1810];

int dxy[5]={-1,0,1,0,-1};
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);

    int N, V, sx,sy,gx,gy;
    cin >> N >> V >>sx >>sy>>gx>>gy;

    REP(i,N) REP(j,N) cin >> grid[i][j];
    V = min(V, 1800);
    REP(i,110)REP(j,110)REP(k,1810) dist[i][j][k] = -1;
    sy--; sx--; gy--;gx--;
    dist[sy][sx][V] = 0;
    queue<pair<int, pair<int, int>>> q;
    q.push(make_pair(V, make_pair(sy, sx)));

    while(q.size()){
        pair<int, pair<int, int>> p = q.front();
        q.pop();

        int r = p.first, y = p.second.first, x = p.second.second;

        for(int i=0; i<4; i++){
            int ny = y + dxy[i], nx = x + dxy[i+1];
            if(ny >= 0 && ny < N && nx >= 0 && nx < N){
                if(r - grid[ny][nx]>0){
                    if(dist[ny][nx][r-grid[ny][nx]] == -1){
                        dist[ny][nx][r-grid[ny][nx]] = dist[y][x][r] + 1;
                        q.push(make_pair(r-grid[ny][nx], make_pair(ny,nx)));
                    }
                }
            }
        }
    }
    int mi = (1<<30);
    for(int i=1; i<=V; i++){
        if(dist[gy][gx][i] != -1) mi = min(mi, dist[gy][gx][i]);
    }
    if(mi == (1<<30)) mi = -1;
    cout << mi << endl;
    return 0;
}