#include <bits/stdc++.h>

#define el '\n'
#define ll long long
#define ld long double

#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

const ll INF = 1e18;

void testCase() {
    int n, k;
    cin >> n >> k;

    vector<pair<int, int>> indices[k + 1];
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            int a;
            cin >> a;

            indices[a].emplace_back(i, j);
        }
    }

    vector<ll> row(n, INF), col(n, INF);

    for (auto &i: indices[1])
        row[i.first] = col[i.second] = 0;

    for (int i = 2; i <= k; i++) {
        vector<ll> newRow(n, INF), newCol(n, INF);

        for (auto &j: indices[i]) {
            ll sol = INF;

            for (int l = 0; l < n; l++) {
                sol = min(sol, abs(l - j.first) * abs(l - j.first) + row[l]);
                sol = min(sol, abs(l - j.second) * abs(l - j.second) + col[l]);
            }

            newRow[j.first] = min(newRow[j.first], sol);
            newCol[j.second] = min(newCol[j.second], sol);
        }

        row = newRow, col = newCol;
    }

    ll sol = INF;

    for (int i = 0; i < n; i++)
        sol = min({sol, row[i], col[i]});

    cout << (sol == INF ? -1 : sol);
}

signed main() {
    Beevo

    int T = 1;
//    cin >> T;

    while (T--)
        testCase();

    return 0;
}