#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
const int N = 21;
const int INF = 1e9;
int n,k;
int dp[1<<N],a[N][N];
int solve(int mask){
if(__builtin_popcount(mask)==k)return 0;
if(dp[mask]!=-1)return dp[mask];
int sol=INF;
for(int i=0;i<n;i++){
if(!(mask&(1<<i)))continue;
for(int j=0;j<n;j++){
if(i==j)continue;
if(!(mask&(1<<j)))continue;
sol=min(sol,solve(mask^(1<<i))+a[i][j]);
}
}
dp[mask]=sol;
return sol;
}
int main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin>>n>>k;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++)cin>>a[i][j];
}
memset(dp,-1,sizeof(dp));
cout<<solve((1<<n)-1);
return 0;
}
