#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <limits>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;  // NOLINT
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
struct Inf { template<typename T> constexpr operator T() { return numeric_limits<T>::max() / 2; } };
// clang-format on

int popcount(ll bits) {
    bits = (bits & 0x5555555555555555LL) + (bits >> 1 & 0x5555555555555555LL);
    bits = (bits & 0x3333333333333333LL) + (bits >> 2 & 0x3333333333333333LL);
    bits = (bits & 0x0f0f0f0f0f0f0f0fLL) + (bits >> 4 & 0x0f0f0f0f0f0f0f0fLL);
    bits = (bits & 0x00ff00ff00ff00ffLL) + (bits >> 8 & 0x00ff00ff00ff00ffLL);
    bits = (bits & 0x0000ffff0000ffffLL) + (bits >> 16 & 0x0000ffff0000ffffLL);
    return (bits & 0x00000000ffffffffLL) + (bits >> 32 & 0x00000000ffffffffLL);
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    auto a = make_v(n, n, 0);
    rep(i, 0, n) {
        rep(j, 0, n) {
            cin >> a[i][j];
        }
    }
    const ll inf = Inf();
    ll ans = inf;
    const int bits = 1 << n;

    rep(cbit, 0, 4) {
        rep(bit, 0, bits) {
            ll sum = 0;
            int nbit = popcount(bit) + popcount(cbit);
            vector<vector<bool>> used(n, vector<bool>(n, false));
            rep(i, 0, n) {
                if ((bit >> i) & 1) {
                    rep(j, 0, n) {
                        used[i][j] = true;
                    }
                }
            }
            if (cbit & 1) {
                rep(i, 0, n) {
                    used[i][i] = true;
                }
            }
            if (cbit & 2) {
                rep(i, 0, n) {
                    used[i][n - i - 1] = true;
                }
            }
            vector<ll> rest(n, 0);
            rep(i, 0, n) {
                rep(j, 0, n) {
                    if (!used[i][j]) {
                        rest[j] += a[i][j];
                    } else {
                        sum += a[i][j];
                    }
                }
            }
            sort(rest.begin(), rest.end());
            rep(i, 0, max(0, m - nbit)) {
                sum += rest[i];
            }
            chmin(ans, sum);
        }
    }
    print(ans);

    return 0;
}