#include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define eps (double)(1e-9)
#define pi (double) acos(-1)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
using namespace std;

int n, m;
vector<vector<int>> a(16, vector<int>(16));

int solve(const vector<vector<bool>> &f, int c){
    if(c > n)return mod;
    vector<int> cost;
    rep(j, n){
        int now = 0;
        rep(i, n){
            now += (!f[i][j]) * a[i][j];
        }
        cost.push_back(now);
    }
    sort(all(cost));
    int ret = 0;
    rep(i, c)ret += cost[i];
    rep(i, n)rep(j, n)ret += a[i][j] * f[i][j];
    return ret;
}

int main() {
    cin >> n >> m;
    rep(i, n)rep(j, n)cin >> a[i][j];
    int ans = mod;
    for(int bit = 0; bit < (1<<n); bit++){
        int cnt = 0;
        vector<vector<bool>> f(n, vector<bool>(m, false));
        rep(i, n){
            if(!(bit & (1<<i)))continue;
            rep(j, n)f[i][j] = true;
            cnt++;
        }
        rep(a, 2)rep(b, 2){
            if(a)rep(i, n)f[i][i] = true;
            if(b)rep(i, n)f[i][n-i-1] = true;
            chmin(ans, solve(f, m-cnt-a-b));
            if(a)rep(i, n)f[i][i] = false;
            if(b)rep(i, n)f[i][n-i-1] = false;
        }
    }
    cout << ans << endl;
}