/*
 _____ _             _              _           _
|_   _| |__   ___   / \   _ __  ___| |__  _   _| |
  | | | '_ \ / _ \ / _ \ | '_ \/ __| '_ \| | | | |
  | | | | | |  __// ___ \| | | \__ \ | | | |_| | |
  |_| |_| |_|\___/_/   \_\_| |_|___/_| |_|\__,_|_|

*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll          long long
#define pb          push_back
#define ppb         pop_back
#define	endl		'\n'
#define mii         map<ll,ll>
#define msi         map<string,ll>
#define mis         map<ll, string>
#define rep(i,a,b)    for(ll i=a;i<b;i++)
#define repr(i,a,b) for(ll i=b-1;i>=a;i--)
#define trav(a, x) 	for(auto& a : x)
#define pii         pair<ll,ll>
#define vi          vector<ll>
#define vii         vector<pair<ll, ll>>
#define vs          vector<string>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define sz(x)       (ll)x.size()
#define hell        1000000007
#define lbnd        lower_bound
#define ubnd        upper_bound

/*	For Debugging	*/
#define DEBUG 		cerr<<"/n>>>I'm Here<<</n"<<endl;
#define display(x) trav(a,x) cout<<a<<" ";cout<<endl;
#define what_is(x)  cerr << #x << " is " << x << endl;

std::mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count());
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define TIME        cerr << "\nTime elapsed: " << setprecision(5) <<1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
#define DECIMAL(n)  cout << fixed ; cout << setprecision(n);
#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace __gnu_pbds;
using namespace std;
#define PI 3.141592653589793
#define N  20
ll n,k,rem;
ll a[N][N],dp[N][(1<<N)],cost[N][(1<<N)];
void solve()
{
	cin>>n>>k;
	ll sum=0;
	rep(i,0,n)
	{
		rep(j,0,n)
		{
			cin>>a[i][j];
			sum+=a[i][j];
		}
	}
	sum/=2;
	ll rem=n-k;
	rep(i,0,k)
	{
		rep(mask,0,(1<<rem))
		{
			cost[i][mask]=0;
			rep(x,0,rem)
			{
				if(mask&(1<<x))
					cost[i][mask]+=a[i][x+k];
			}
			rep(x,0,rem)
			{
				if(mask&(1<<x))
				{
					rep(y,x+1,rem)
					{
						if(mask&(1<<y))
						{
							cost[i][mask]+=a[x+k][y+k];
						}
					}
				}
			}
		}
	}
	// rep(i,0,k)
	// {
	// 	rep(j,0,(1<<rem))
	// 	cout<<cost[i][j]<<" ";
	// 	cout<<endl;
	// }
	rep(mask,0,(1<<rem))
	{
		dp[0][mask]=cost[0][mask];
	}
	rep(i,1,k)
	{
		rep(mask,0,(1<<rem))
		{
			dp[i][mask]=0;
			for(ll j=mask;j>0;j=((j-1)&mask))
			{
				dp[i][mask]=max(dp[i][mask],dp[i-1][j]+cost[i][(j^mask)]);
			}
			dp[i][mask]=max(dp[i][mask],dp[i-1][0]+cost[i][mask]);
		}
	}
	// rep(i,0,k)
	// {
	// 	rep(j,0,(1<<rem))
	// 	cout<<dp[i][j]<<" ";
	// 	cout<<endl;
	// }
	cout<<sum-dp[k-1][(1<<rem)-1]<<endl;
	return;
}
int main()
{
	FAST
	int TESTS=1;
	/************************************/
	// freopen("input.txt","r",stdin);
	// freopen("out.txt","w",stdout);
	/***********************************/
	cin>>TESTS;
	while(TESTS--)
	{
		solve();
	}
	TIME
	return 0;
}