#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<vector<int>> c(n, vector<int>(n));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> c[i][j];
}
}
int ans = INT_MAX;
vector<int> dp((1<<n), 1e9);
dp[0] = 0, dp[(1<<n)-1] = 0;
for (int mask = (1<<n); mask >= 0; mask--) {
if (__builtin_popcount(mask) == k) continue;
for (int i = 0; i < n; i++) {
if (!(mask & (1<<i))) continue;
// try pouring contents of this glass into every other glass
for (int j = 0; j < n; j++) {
if (i != j && mask & (1<<j))
dp[mask-(1<<i)] = min(dp[mask-(1<<i)], dp[mask]+c[i][j]);
}
}
}
for (int mask = 0; mask < (1<<n); mask++) {
if (__builtin_popcount(mask) == k) ans = min(ans, dp[mask]);
}
cout << ans << '\n';
return 0;
}
