#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 100010
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9
using namespace std;
//using namespace __gnu_pbds;
typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 2> a2;
//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
ll mn[(1 << 20)], a[25][25];
int main()
{
//freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);
ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) cin >> a[i][j];
ll ans = 1e18;
for (int i = 0; i < (1 << 20); i++) mn[i] = 1e18;
mn[(1 << n) - 1] = 0;
for (int msk = (1 << n) - 1; msk >= 0; msk--)
{
if (__builtin_popcount(msk) > k)
{
for (int i = 0; i < n; i++)
if ((1 << i) & msk)
{
int nmsk = msk ^ (1 << i);
for (int j = 0; j < n; j++)
if ((1 << j) & nmsk) mn[nmsk] = min(mn[nmsk], mn[msk] + a[i][j]);
}
}
else ans = min(ans, mn[msk]);
}
cout << ans << endl;
}
