#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

constexpr int dx[4] = {1, 0, -1, 0};
constexpr int dy[4] = {0, 1, 0, -1};

int N, V, sx, sy, gx, gy, L[100][100], dp[101][101][10001];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> N >> V >> sy >> sx >> gy >> gx;
    --sx, --sy, --gx, --gy;
    for(int i = 0; i < N; ++i){
        for(int j = 0; j < N; ++j){
            cin >> L[i][j];
        }
    }

    for(int i = 0; i < N; ++i){
        for(int j = 0; j < N; ++j){
            for(int k = 0; k <= V; ++k){
                dp[i][j][k] = INF;
            }
        }
    }
    dp[sx][sy][V] = 0;
    queue<tuple<int, int, int>> que;
    que.emplace(sx, sy, V);
    while(!que.empty()){
        auto [x, y, hp] = que.front();
        que.pop();
        for(int i = 0; i < 4; ++i){
            int nx = x + dx[i], ny = y + dy[i];
            if(nx < 0 || nx >= N || ny < 0 || ny >= N)  continue;
            int hp2 = hp - L[nx][ny];
            if(hp2 > 0 && chmin(dp[nx][ny][hp2], dp[x][y][hp] + 1)){
                if(nx == gx && ny == gy){
                    cout << dp[nx][ny][hp2] << endl;
                    return 0;
                }
                que.emplace(nx, ny, hp2);
            }
        }
    }

    cout << -1 << endl;

    return 0;
}