#include <iostream>
#include <cstring>
using namespace std;
int T, n, m;
const int N = 8;
int a[N][N];
bool vis[N][N];
long long maxn = 0;
void dfs (int i, int j, long long sum) {
	if (j == m + 1) {
		dfs(i + 1, 1, sum);
		return;
	}
	if (i == n + 1) {
		maxn = max(maxn, sum);
		return;
	} 
	dfs(i, j + 1, sum);
	if (!vis[i][j]) {
		vis[i - 1][j] = vis[i + 1][j] = vis[i][j + 1] = vis[i][j - 1] = vis[i][j] = vis[i - 1][j - 1] = vis[i + 1][j + 1] = vis[i + 1][j - 1] = vis[i - 1][j + 1] = 1;
		dfs(i, j + 1, sum += a[i][j]);
		vis[i - 1][j] = vis[i + 1][j] = vis[i][j + 1] = vis[i][j - 1] = vis[i][j] = vis[i - 1][j - 1] = vis[i + 1][j + 1] = vis[i + 1][j - 1] = vis[i - 1][j + 1] = 0;
	}
}
int main () {
	cin >> T;
	while (T --) {
		maxn = 0;
		memset(a, 0, sizeof(a));
		memset(vis, 0, sizeof(vis));
		cin >> n >> m;
		for (int i = 1; i <= n; i ++) {
			for (int j = 1; j <= m; j ++) {
				cin >> a[i][j];
			}
		}
		dfs(1, 1, 0);
		cout << maxn << '\n';
	}
	return 0;
}