#include<iostream>
#include<algorithm>
using namespace std;
int N,M;
int A[16][16];
main()
{
	cin>>N>>M;
	for(int i=0;i<N;i++)for(int j=0;j<N;j++)cin>>A[i][j];
	long comb=(1L<<M)-1;
	int ans=1e9;
	while(comb<1L<<N+N+2)
	{
		int now=0;
		for(int i=0;i<N;i++)for(int j=0;j<N;j++)
		{
			if(comb>>i&1||comb>>N+j&1)now+=A[i][j];
			else
			{
				if(i==j&&comb>>N+N&1)now+=A[i][j];
				else if(i+j==N-1&&comb>>N+N+1&1)now+=A[i][j];
			}
		}
		if(ans>now)ans=now;
		long x=comb&-comb;
		long y=comb+x;
		comb=(comb&~y)/x>>1|y;
	}
	cout<<ans<<endl;
}