#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif

using namespace std;
using i64 = int64_t;
using vi = vector<i64>;
using vvi = vector<vi>;
constexpr i64 MOD = 1000000000;
using ii = pair<int, int>;

int main() {
    int n, v;
    cin >> n >> v;
    int sx, sy, gx, gy;
    cin >> sy >> sx >> gy >> gx;
    sy--;
    sx--;
    gy--;
    gx--;
    
    vvi b(n, vi(n));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cin >> b[i][j];
        }
    }
    
    if (v > 2000) {
        cout << abs(sx - gx) + abs(sy - gy) << endl;
        return 0;
    }
    i64 INF = 1e9;
    vector<vvi> dp(n, vvi(n, vi(v + 1, INF)));
    dp[sx][sy][v] = 0;
    using iii = pair<ii, int>;
    queue<iii> que;
    que.push(iii(ii(sx, sy), v));
    int dx[] = {1, -1, 0, 0};
    int dy[] = {0, 0, 1, -1};
    
    auto ok = [&](int x, int y) {
        return 0 <= x && x < n && 0 <= y && y < n;
    };
    while (que.size()) {
        iii top = que.front();
        que.pop();
        int X = top.first.first;
        int Y = top.first.second;
        int V = top.second;
        for (int i = 0; i < 4; i++) {
            int x = X + dx[i];
            int y = Y + dy[i];
            if (ok(x, y)) {
                int w = V - b[x][y];
                if (w > 0) {
                    if (dp[X][Y][V] + 1 < dp[x][y][w]) {
                        dp[x][y][w] = dp[X][Y][V] + 1;
                        que.push(iii(ii(x, y), w));
                    }
                }
            }
        }
    }
    
    i64 ans = 1e9;
    for (int i = 1; i <= v; i++) {
        ans = min(ans, dp[gx][gy][i]);
    }
    cout << (ans == 1e9 ? -1 : ans) << endl;
}