#include <bits/stdc++.h>
#define taskname ""
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define for0(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex <ld> cd;
typedef vector <cd> vcd;
typedef vector <int> vi;
template<class T> using v2d = vector <vector <T> >;
template<class T> bool uin(T &a, T b)
{
return a > b ? (a = b, true) : false;
}
template<class T> bool uax(T &a, T b)
{
return a < b ? (a = b, true) : false;
}
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
const int maxN = 20;
int n, k;
ll c[maxN][maxN], f[maxN][1 << maxN], g[1 << maxN];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> k;
for0(i, n)
{
for0(j, n)
{
cin >> c[i][j];
}
}
for0(i, n)
{
f[i][0] = 1e9;
for (int mask = 1; mask < (1 << n); mask++)
{
f[i][mask] = min(f[i][mask & (mask - 1)], c[i][__builtin_ctz(mask)]);
}
}
for (int mask = (1 << n) - 2; mask > 0; mask--)
{
g[mask] = 1e9;
for0(i, n)
{
if (!(mask >> i & 1))
{
uin(g[mask], g[mask | (1 << i)] + f[i][mask]);
}
}
}
ll ans = 1e9;
for0(mask, 1 << n)
{
if (__builtin_popcount(mask) == k)
{
uin(ans, g[mask]);
}
}
cout << ans;
return 0;
}
