#include <bits/stdc++.h>
using namespace std;
const int maxn = 20;
#define int long long
int n, k;
int c[maxn][maxn];
int dp[1 << 20];
int dist[maxn];
int qt;
int solve(int mask)
{
if(__builtin_popcount(mask) >= n - k) return 0;
if(dp[mask] != -1) return dp[mask];
int ans = 1e9;
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
if(i == j or (mask & (1 << i)) or (mask & (1 << j))) continue;
ans = min(ans, solve(mask | (1 << i)) + c[i][j]);
}
}
return dp[mask] = ans;
}
int32_t main()
{
cin >> n >> k;
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
cin >> c[i][j];
}
memset(dp, -1, sizeof(dp));
cout << solve(0) << "\n";
}
