#include <bits/stdc++.h>
using namespace std;
const int maxn = 20;
#define int uint_fast32_t
#pragma GCC optimize ("Ofast")
int n, k;
int c[maxn][maxn];
int dp[1 << 20];
int32_t main()
{
ios::sync_with_stdio(false), cin.tie(nullptr);
cin >> n >> k;
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
cin >> c[i][j];
}
for(int mask = (1 << n) - 1; mask >= 0; mask--)
{
if(__builtin_popcount(mask) >= n - k) {dp[mask] = 0; continue;}
int ans = 1e7;
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, dp[mask ^ (1 << i)] + c[i][j]);
}
}
dp[mask] = ans;
}
cout << dp[0] << "\n";
}
