#include <bits/stdc++.h>
using namespace std;
namespace io {
inline char nc() {
  static char buf[100000], *p1 = buf, *p2 = buf;
  return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
             ? EOF
             : *p1++;
}
template <class I>
inline void fr(I &num) {
  num = 0;
  register char c = nc();
  register int p = 1;
  while (c < '0' || c > '9') c == '-' ? p = -1, c = nc() : c = nc();
  while (c >= '0' && c <= '9') num = num * 10 + c - '0', c = nc();
  num *= p;
}
template <class I>
inline I Max(I p, I q) {
  return p > q ? p : q;
}
template <class I>
inline I Min(I p, I q) {
  return p < q ? p : q;
}
template <class I>
inline I A(I x) {
  return x < 0 ? -x : x;
}
template <class I>
inline void sp(I &p, I &q) {
  I x = p;
  p = q, q = x;
}
template <class I>
inline void ckMax(I &p, I q) {
  p = (p > q ? p : q);
}
template <class I>
inline void ckMin(I &p, I q) {
  p = (p < q ? p : q);
}
};  // namespace io
using io ::A;
using io ::ckMax;
using io ::ckMin;
using io ::fr;
using io ::Max;
using io ::Min;
using io ::nc;
using io ::sp;
const int N = 105, inf = 1e8;
pair<int, int> f[N][N][N];
int a[N][N], tag[N], ans, n, m, o[N], mm;
inline int cal(const int x, const int y) {
  for (register int i = 1; i <= n; i++)
    if (!tag[f[x][y][i].second]) return f[x][y][i].first;
  return inf;
}
inline void dfs(const int x) {
  if (x == m) {
    register int s = 0, i;
    for (i = 0; i < mm; ++i) s += cal(o[i], o[(i + 1) % mm]);
    ans = (ans < s ? ans : s);
    return;
  }
  for (register int i = 1; i <= n; ++i)
    ++tag[i], o[x >> 1] = i, dfs(x + 2), --tag[i];
}
int main() {
  scanf("%d%d", &n, &m), mm = m >> 1, ans = 2e9;
  register int i, j, k;
  for (i = 1; i <= n; ++i)
    for (j = 1; j <= n; ++j) scanf("%d", &a[i][j]);
  for (i = 1; i <= n; ++i)
    for (j = 1; j <= n; ++j) {
      for (k = 1; k <= n; ++k) f[i][j][k] = make_pair(a[i][k] + a[k][j], k);
      std::sort(f[i][j] + 1, f[i][j] + n + 1);
    }
  o[0] = tag[1] = 1, dfs(2), printf("%d", ans);
  return 0;
}
