#include<bits/stdc++.h>
using namespace std;
using LL=long long;
using ULL=unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

int N,M;
int A[16][16];
int B[16][16];
int offset=0;
int ans=1000000000;

int solve(int m){
  int ians=1000000000;
  rep(R,1<<N){
    int xm=m; rep(i,N) if(R&(1<<i)) xm--;
    if(xm>N) continue;
    int S=0; int C[16]={};
    rep(i,N) rep(j,N) if(R&(1<<i)) S+=B[i][j]; else C[j]+=B[i][j];
    sort(C,C+N);
    rep(i,xm) S+=C[i];
    ians=min(ians,S);
  }
  return ians;
}

int main(){
  scanf("%d%d",&N,&M);
  rep(i,N) rep(j,N) scanf("%d",&A[i][j]);
  rep(i,N) rep(j,N) B[i][j]=A[i][j];

  ans=min(ans,solve(M)+offset);
  rep(i,N){ B[i][i]=0; offset+=A[i][i]; }
  ans=min(ans,solve(M-1)+offset);
  rep(i,N) if(i*2+1!=N) { B[i][N-1-i]=0; offset+=A[i][N-1-i]; }
  ans=min(ans,solve(M-2)+offset);
  rep(i,N) if(i*2+1!=N) { B[i][i]=A[i][i]; offset-=A[i][i]; }
  ans=min(ans,solve(M-1)+offset);
  printf("%d\n",ans);
  return 0;
}