#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define fi first
#define se second
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll mod_998244353 = 998244353;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

//using lll=boost::multiprecision::cpp_int;
//using Double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<128>>;//仮数部が1024桁
template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

template <typename T>
T mypow(T x, T n, const T &p = -1)
{ //x^nをmodで割った余り

	if (p != -1)
	{
		x =(x%p+p)%p;
	}
	T ret = 1;
	while (n > 0)
	{
		if (n & 1)
		{
			if (p != -1)
				ret = (ret * x) % p;
			else
				ret *= x;
		}
		if (p != -1)
			x = (x * x) % p;
		else
			x *= x;
		n >>= 1;
	}
	return ret;
}

using namespace std;
//using namespace atcoder;

void solve()
{	
	int n,m;
	cin>>n>>m;
	vector<vector<int>>a(n,vector<int>(n));
	rep(i,n){
		rep(j,n){
			cin>>a[i][j];
		}
	}

	vector<int>row(n);
	rep(i,n)row[i]=accumulate(all(a[i]),0);
	int ans=1e9;
	rep(bit,1<<n){
		int res=0;
		rep(i,n){
			if(bit&1<<i){
				res+=row[i];
			}
		}
		if(bit==(1<<n)-1){
			chmin(ans,res);
			break;
		}
		int rest=m-popcount(bit);
		priority_queue<int,vector<int>,greater<>>pq;
		rep(j,n){
			int sum=0;
			rep(i,n){
				if(!(bit&1<<i)){
					sum+=a[i][j];
				}
			}
			pq.emplace(sum);
		}
		int sum=0;
		rep(i,n){
			if(!(bit&1<<i))sum+=a[i][i];
		}
		pq.emplace(sum);
		sum=0;
		rep(i,n){
			if(!(bit&1<<i))sum+=a[i][n-1-i];
		}
		pq.emplace(sum);
		if(pq.size()<rest)continue;
		rep(i,rest){
			int val=pq.top();
			pq.pop();
			res+=val;
		}
		chmin(ans,res);
	}
	cout<<ans<<"\n";
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}