#include <bits/stdc++.h>
//#define int int64_t
#define f first
#define s second
#define opt1 ios_base::sync_with_stdio(false)
#define opt2 cin.tie(NULL)
#define optimize opt1; opt2
#define pb push_back
#define sz(v) (int)v.size()
using namespace std;
typedef pair<int, int> ii;
typedef pair<int, ii> i3;
typedef pair<ii, ii> i4;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<i3> vi3;
typedef vector<i4> vi4;
const int inf = 1e8;
const int MAX = 300005;
const int mod = 1e9+7;
int N, K, dist[20][20];
int32_t main () {
optimize;
cin >> N >> K;
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
cin >> dist[i][j];
if (N == K) {
cout << 0 << endl;
return 0;
}
int res, dp[(1<<N)][K+1];
int add;
for (int k = 0; k <= K; k++)
dp[(1<<N)-1][k] = 0;
for (int mask = (1<<N)-2; mask >= 0; mask--) {
for (int k = 0; k <= K; k++) {
res = inf;
for (int i = 0; i < N; i++) {
if (mask & (1<<i)) continue;
add = inf;
for (int j = 0; j < N; j++) {
if (mask & (1<<j) || i == j) continue;
add = min(add, dist[i][j]);
}
res = min(res, dp[mask|(1<<i)][k]+add);
if (k > 0)
res = min(res, dp[mask|(1<<i)][k-1]);
}
dp[mask][k] = res;
}
}
cout << dp[0][K] << endl;
return 0;
}
