#include <bits/stdc++.h>
struct MI {
 private:
  char bb[1 << 14];
  FILE *f;
  char *bs, *be;
  char e;
  bool o, l;

 public:
  MI() : f(stdin), bs(0), be(0) {}
  inline char get() {
    if (o) {
      o = 0;
      return e;
    }
    if (bs == be) be = (bs = bb) + fread(bb, 1, sizeof(bb), f);
    if (bs == be) {
      l = 1;
      return -1;
    };
    return *bs++;
  }
  inline void unget(char c) {
    o = 1;
    e = c;
  }
  template <class T>
  inline MI &operator>(T &);
};
template <class T>
struct Q {
  const static bool U = T(-1) >= T(0);
  inline void operator()(MI &t, T &r) const {
    r = 0;
    char c;
    bool y = 0;
    if (U)
      for (;;) {
        c = t.get();
        if (c == -1) goto E;
        if (isdigit(c)) break;
      }
    else
      for (;;) {
        c = t.get();
        if (c == -1) goto E;
        if (c == '-') {
          c = t.get();
          if (isdigit(c)) {
            y = 1;
            break;
          };
        } else if (isdigit(c))
          break;
        ;
      };
    for (;;) {
      if (c == -1) goto E;
      if (isdigit(c))
        r = r * 10 + (c ^ 48);
      else
        break;
      c = t.get();
    }
    t.unget(c);
  E:;
    if (y) r = -r;
  }
};
template <>
struct Q<char> {};
template <class T>
inline MI &MI::operator>(T &t) {
  Q<T>()(*this, t);
  return *this;
}
template <class T>
std::ostream &operator<(std::ostream &out, const T &t) {
  return out << t;
}
using std::cout;
MI cin;
const int $n = 85;
const int $k = 15;
template <typename T>
inline bool gmin(T &a, const T &b) {
  return b < a && (a = b, true);
}
int n, k, v[$n][$n], dis[$k][$n];
bool c[$n];
std::mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
int main() {
  cin > n > k;
  for (int __r = (n), i = (1); i <= __r; ++i)
    for (int __r = (n), j = (1); j <= __r; ++j) cin > v[i][j];
  std::uniform_int_distribution<int> dist(0, 1);
  int ans = INT_MAX;
  for (int __r = (20000), _ = (1); _ <= __r; ++_) {
    for (int __r = (n), i = (2); i <= __r; ++i) c[i] = dist(rng);
    memset(dis, 0x3f, sizeof(dis));
    dis[0][1] = 0;
    for (int __r = (k), t = (1); t <= __r; ++t)
      for (int __r = (n), i = (1); i <= __r; ++i)
        if (c[i] == (t & 1))
          for (int __r = (n), j = (1); j <= __r; ++j)
            gmin(dis[t][i], dis[t - 1][j] + v[j][i]);
    gmin(ans, dis[k][1]);
  }
  cout < ans < ('\n');
}
