#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
#define PB push_back
#define MP make_pair
#define A first
#define B second
#define SZ(x) int(x.size())
#define FR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR(i, n) FR(i, 0, n)
const int M = 1000000007;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());

int n, k;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> k;
    vector<vector<vi>> dp(n + 5);
    FOR(i, n) {
        FOR(j, n) {
            int x;
            cin >> x;
            dp[x].PB({i, j, 0});
        }
    }
    int mn = 1 << 30;
    FR(i, 2, k + 1) {
        int s = SZ(dp[i - 1]);
        int t = SZ(dp[i]);

        FOR(j, t) {
            dp[i][j][2] = 1 << 30;
            FOR(l, s) {
                dp[i][j][2] = min(dp[i][j][2], dp[i - 1][l][2] + abs(dp[i - 1][l][0] - dp[i][j][0]) + abs(dp[i - 1][l][1] - dp[i][j][1]));
            }
            if (i == k) mn = min(mn, dp[i][j][2]);
        }
    }
    if (mn == (1 << 30)) cout << "-1\n";
    else cout << mn << '\n';
}