#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define sz(x) (int)x.size()
#define int long long
typedef pair<int,int>pii;
const int mxN=21,M=1e9+7;
//did u check when n=1?
//is mxN correct?
int n,k,tot;
int tab[mxN][mxN];
int dp[1<<mxN];
int solve(int mask){
if(dp[mask]!=-1)return dp[mask];
if(__builtin_popcount(mask)<=k) return dp[mask]=0;
int ans=M;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(!(mask & (1<<i))||!(mask & (1<<j)))continue;
if(i==j)continue;
ans=min(ans,solve(mask^(1<<i))+tab[i][j]);
}
}
return dp[mask]=ans;
}
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
memset(dp,-1,sizeof(dp));
cin>>n>>k;
tot=(1<<n)-1;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin>>tab[i][j];
}
}
cout<<solve(tot);
}
