#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef pair<int,int> Pair;
typedef tuple<int,int,int> tpl;

#define ALL(a)  (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define REVERSE(c) reverse((c).begin(),(c).end())
#define EXIST(m,v) (m).find((v)) != (m).end()
#define LB(a,x) lower_bound((a).begin(), (a).end(), x) - (a).begin()
#define UB(a,x) upper_bound((a).begin(), (a).end(), x) - (a).begin()

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);--i)
#define RREP(i,n) RFOR(i,n,0)

#define en "\n"

constexpr double EPS = 1e-9;
constexpr double PI  = 3.1415926535897932;
constexpr int INF = 2147483647;
constexpr long long LINF = 1LL<<60;
constexpr long long MOD = 1000000007; // 998244353;

template<class T> inline bool chmax(T& a, T b){if(a<b){a=b;return true;}return false;}
template<class T> inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;}

int N;
VVI v;

int solve(VVI& A, int M){
    if(M<=0) return 0;
    int ret = INF;
    REP(i,1<<N){
        int nbit = 0, base = 0;
        REP(j,N)
            if((i>>j)&1){
                nbit++;
                REP(k,N) base += A[j][k];
            }
        if(M-nbit>N || M-nbit<0) continue;

        for(int S : v[M-nbit]){
            int tmp = 0;
            REP(j,N){
                if(((S>>j)&1) == 0) continue;
                REP(k,N){
                    if((i>>k)&1) continue;
                    tmp += A[k][j];
                }
            }
            chmin(ret, base+tmp);
        }
    }
    return ret;
}

void Main(){
    int M; cin >> N >> M;
    VVI A(N,VI(N)); REP(i,N)REP(j,N) cin >> A[i][j];

    v.resize(N+1);
    REP(i,1<<N){
        int cnt = 0;
        REP(j,N) if((i>>j)&1) cnt++;
        v[cnt].push_back(i);
    }

    int ans = solve(A,M);
    // 対角線1本
    int base = 0;
    VVI B(A); REP(i,N) B[i][i] = 0, base += A[i][i];
    chmin(ans, solve(B,M-1)+base);

    base = 0;
    B = VVI(A); REP(i,N) B[i][N-1-i] = 0, base += A[i][N-1-i];
    chmin(ans, solve(B,M-1)+base);

    // 対角線2本
    base = 0;
    B = VVI(A); REP(i,N) B[i][i] = B[i][N-1-i] = 0;
    REP(i,N){
        base += A[i][i] + A[i][N-1-i];
        if(i == N-1-i) base -= A[i][i];
    }
    chmin(ans, solve(B,M-2)+base);

    cout << ans << en;
    return;
}

int main(void){
    cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);cout<<fixed<<setprecision(15);
    int t=1; //cin>>t;
    REP(_,t) Main();
    return 0;
}