#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#define ll long long
using namespace std;
ll a[10][10],ans,v[10][10];
int dx[4]={-1,-1,-1,0};
int dy[4]={0,-1,1,-1};
int T,n,m;
int check(int x,int y)
{
	for(int i=0;i<4;i++)
	{
		int xx=x+dx[i];
		int yy=y+dy[i];
		if(xx<1||xx>n||yy<1||yy>n)continue;
		if(v[xx][yy]==1)return 0;
	}
	return 1;
}
void dfs(int idx,ll s)
{
	if(idx==n*m)
	{
		ans=max(ans,s);
		return;
	}
	dfs(idx+1,s);
	int x=idx/m+(idx%m>0);
	int y=idx%m+(idx%m==0)*m;
	if(check(x,y)==1)
	{
		v[x][y]=1;
		dfs(idx+1,s+a[x][y]);
		v[x][y]=0;
	}
}
int main()
{
	cin>>T;
	while(T--)
	{
		memset(v,0,sizeof(v));
		cin>>n>>m;
		ans=0;
		for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)cin>>a[i][j];
		dfs(1,0);
		cout<<ans<<endl;
	}
	return 0;
}