#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define AC "test"
#define foru(i, l, r) for (int i = (l); i <= (r); i++)
#define ford(i, l, r) for (int i = (l); i >= (r); i--)
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vii;
typedef vector<ll> vll;
const ll inf = 1e9 + 7;
const ll linf = 1e18 + 7;
const int mod = 1e9 + 7;
const int maxn = 21;
const int base = 31;
void fastIO(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
ll mul(ll a, ll b){
a%=mod;
ll res = 0;
while (b){
if (b%2) res = (res + a)%mod;
a = (a + a)%mod;
b/=2;
}
return res;
}
ll Pow(ll a, ll b){
ll ans = 1;
while (b){
if (b % 2) ans = mul(ans, a);
a = mul(a, a);
b/=2;
}
return ans;
}
int n, k, a[maxn][maxn], dp[1100000], res;
void inp(){
cin >> n >> k;
foru(i, 1, n){
foru(j, 1, n){
cin >> a[i][j];
}
}
fill_n(dp, 1100000, inf);
dp[0] = 0;
foru(mask, 1, (1 << n)){
foru(i, 0, n - 1){
if ((mask >> i) & 1){
foru(j, 0, (n - 1)){
if (i != j && ((mask >> j) & 1) == 0){
dp[mask] = min(dp[mask], dp[mask ^ (1 << i)] + a[i + 1][j + 1]);
}
}
}
}
}
res = inf;
foru(mask, 0, (1 << n)){
if (__builtin_popcount(mask) == n - k){
res = min(res, dp[mask]);
}
}
cout << res;
}
int main(){
fastIO();
if (fopen(AC".inp", "r")){
freopen(AC".inp", "r", stdin);
freopen(AC".out", "w", stdout);
}
inp();
}
