#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
template<class T> void chmax(T& a, const T& b) {a = max(a, b);}
template<class T> void chmin(T& a, const T& b) {a = min(a, b);}
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

short a[16][16];
short cs[16];
bool use[16][16];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    rep(i, n) rep(j, n) cin >> a[i][j];
    short ans = 30000;
    rep(s, 1 << n + 2) {
        rep(i, n) rep(j, n) use[i][j] = false;
        rep(i, n) if (s >> i & 1) rep(j, n) use[i][j] = true;
        if (s >> n & 1) rep(i, n) use[i][i] = true;
        if (s >> n + 1 & 1) rep(i, n) use[n-1-i][i] = true;
        short score = 0;
        rep(i, n) rep(j, n) score += use[i][j] * a[i][j];
        rep(i, n) cs[i] = 0;
        rep(i, n) rep(j, n) if (!use[i][j]) cs[j] += a[i][j];
        sort(cs, cs + n);
        int idx = 0;
        short cnt = __builtin_popcount(s);
        while(cnt < m && idx < n) score += cs[idx++], cnt++;
        if (cnt == m) chmin(ans, score);
    }
    cout << ans << endl;
}