/* -*- coding: utf-8 -*-
 *
 * 1345.cc:  No.1345 Beautiful BINGO - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 16;
const int INF = 1 << 30;

/* typedef */

/* global variables */

int as[MAX_N][MAX_N], hss[MAX_N];
int bnums[1 << (MAX_N + 2)];

/* subroutines */

/* main */

int main() {
  int n, m;
  scanf("%d%d", &n, &m);

  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) scanf("%d", as[i] + j);

  int kbits = 1 << (n + 2);
  int minsum = INF;

  for (int bits = 0, msb = 1; bits < kbits; bits++) {
    if (bits > 0) {
      if ((msb << 1) <= bits) msb <<= 1;
      bnums[bits] = bnums[bits ^ msb] + 1;
    }

    int r = m - bnums[bits];
    if (r > n) continue;

    bool d0 = ((bits >> n) & 1), d1 = ((bits >> (n + 1)) & 1);
    int sum = 0;
    for (int i = 0; i < n; i++) {
      hss[i] = 0;
      for (int j = 0, bj = 1; j < n; j++, bj <<= 1) {
	if ((bits & bj) || (d0 && i == j) || (d1 && i + j == n - 1))
	  sum += as[i][j];
	else
	  hss[i] += as[i][j];
      }
    }
    //printf("bits=%d, sum=%d\n", bits, sum);

    if (r > 0) {
      sort(hss, hss + n);
      for (int i = 0; i < r; i++) sum += hss[i];
    }

    if (minsum > sum) minsum = sum;
  }

  printf("%d\n", minsum);
  return 0;
}