#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <tuple>
#include <iomanip>
using namespace std;

#define endl '\n'
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int, int> T;
typedef unsigned int uint;
typedef unsigned long long ull;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};

const int inf = 1000000009;
const double eps = 1e-8;
bool used[105][105][10010];

int solve(int n, int v, int sx, int sy, int gx, int gy) {
    int ls[105][105];
    for (int i = 1; i <= n; i++) {
	for (int j = 1; j <= n; j++) {
	    scanf("%d", &ls[i][j]);
	}
    }

    //memset(used, false, sizeof(used));
    const int dx[4] = {0, 1, 0, -1};
    const int dy[4] = {1, 0, -1, 0};
    queue<T> que;
    used[sy][sx][v] = true;
    que.push(make_tuple(sy, sx, v, 0));
    while (!que.empty()) {
	T t = que.front(); que.pop();
	int x = get<0>(t), y = get<1>(t), r = get<2>(t), d = get<3>(t);
	if (x == gy && y == gx) return d;
	for (int i = 0; i < 4; i++) {
	    int X = x + dx[i], Y = y + dy[i];
	    if (1 <= X && X <= n && 1 <= Y && Y <= n && r-ls[X][Y] > 0 && !used[X][Y][r-ls[X][Y]]) {
		used[X][Y][r-ls[X][Y]] = true;
		que.push(make_tuple(X, Y, r-ls[X][Y], d+1));
	    }
	}
    }
    return -1;
}

int main() {
    /*
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);
    */
    int n, v, sx, sy, gx, gy;
    scanf("%d%d%d%d%d%d", &n, &v, &sx, &sy, &gx, &gy);
    printf("%d\n", solve(n, v, sx, sy, gx, gy));
}