#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
using namespace std;
using P = pair<int, int>;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

vector<ll> sum_result(const vector<vector<ll>> &A, int n){
  vector<ll> sum(2 * n + 2);
  rep(i, 2 *n +2){
    if(i < n){
      rep(j, n){
        sum[i] += A[i][j];
      }
    }else if(i >= n && i < 2 * n){
      rep(j, n){
        sum[i] += A[j][i - n];
      }
    }else{
      if(i == 2 * n){
        rep(j, n){
          sum[i] += A[j][j];
        }
      }else{
        rep(j, n){
          sum[i] += A[j][n -1- j];
        }
      }
    }
  }
  return sum;
}

int main() {
  int n, m;
  cin >> n >> m;
  ll ans = (1LL << 50);
  vector<vector<ll>> A(n, vector<ll>(n));
  rep(i, n) rep(j, n) cin >> A[i][j];
  vector<ll> sum = sum_result(A, n);
  for (int bit = 1; bit < (1 << (2 * n + 2)); bit++){
    int d = __builtin_popcount(bit);
    if(d != m)continue;
    ll res = 0;
    vector<int> cnt_i(n);
    vector<int> cnt_j(n);
    vector<vector<int>> cnt(n, vector<int>(n, 0));
    rep(i, 2 *n +2){
      if(bit & (1 << i)){
        res += sum[i];
        if(i < n){
          cnt_i[i]++;
        }else if(i >= n && i < 2 * n)  {
          cnt_j[i - n]++;
        }else{
          if(i == 2 * n){
            rep(j, n){
              cnt[j][j]++;
            }
          }else{
            rep(j, n){
              cnt[j][n - 1 - j]++;
            }
          }
        }
      }
    }
    rep(i, n){
      rep(j, n){
        int f = cnt_i[i] + cnt_j[j] + cnt[i][j];
        if(f > 0)res -= (f -1) * A[i][j];
      }
    }
    chmin(ans, res);
  }
  cout << ans << endl;
}