#include "bits/stdc++.h"
using namespace std;
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()

const int mxn = 8;
const int inf = 1e9;

void ckmax(int &a, int b) {
	a = max(a,b);
}

int n,m,g[mxn][mxn];
int dp[mxn][mxn][1<<mxn][2][mxn*mxn];

void solve() {
	memset(dp,-1,sizeof(dp));
	cin>>n>>m;
	for (int i=0; i<n; i++) {
		for (int j=0; j<m; j++) {
			char c; cin>>c;
			g[i][j] = c-'0';
		}
	}
	dp[0][0][0][0][0] = 0;
	if (g[0][0]) {dp[0][0][1][1][1] = 2;}
	for (int x=0; x<n; x++) {
		for (int y=1; y<m; y++) {
			for (int umk=0; umk<(1<<m); umk++) {
				for (int lr=0; lr<2; lr++) {
					for (int cnt=0; cnt<n*m; cnt++) {
						if (dp[x][y-1][umk][lr][cnt]==-1) continue;
						//case 1 - no mirror
						int av1 = 0;
						if (lr) av1++;
						if ((1<<y)&umk) av1++;
						ckmax(dp[x][y][umk][lr][cnt],dp[x][y-1][umk][lr][cnt]+av1);
						if (!g[x][y]) continue;
						//case 2 - /, no send
						if (lr && (umk&(1<<y))) {ckmax(dp[x][y][umk-(1<<y)][0][cnt+1],dp[x][y-1][umk][lr][cnt]);}
						//case 3 - /, send
						if ( lr&&(umk&(1<<y)) || (!lr)&&!(umk&(1<<y)) ) {
							ckmax(dp[x][y][umk|(1<<y)][1][cnt+1],dp[x][y-1][umk][lr][cnt]+2);
						}
						//case 4 - \, no send down
						if (!lr && (umk&(1<<y))) {ckmax(dp[x][y][umk-(1<<y)][1][cnt+1],dp[x][y-1][umk][lr][cnt]+1);}
						//case 5 - \, send down
						if (lr) {							
							ckmax(dp[x][y][umk|(1<<y)][(umk>>y)&1][cnt+1],dp[x][y-1][umk][lr][cnt]+1+((umk>>y)&1));
						}
					}
				}
			}
		}
		for (int umk=0; umk<(1<<m); umk++) {
			for (int cnt=0; cnt<n*m; cnt++) {
				//transition from dp[x][m-1][umk][0][cnt]
				//case 1 - no mirror
				if (dp[x][m-1][umk][0][cnt]==-1) continue;
				int av1 = 0;
				if (1&umk) av1++;
				ckmax(dp[x+1][0][umk][0][cnt],dp[x][m-1][umk][0][cnt]+av1);
				if (!g[x+1][0]) continue;
				//case 2 - mirror \`
				if (umk&1) {
					ckmax(dp[x+1][0][umk-1][1][cnt+1],dp[x][m-1][umk][0][cnt]+1);
				}
				//case 3 - mirror / '
				if (!(umk&1)) {
					ckmax(dp[x+1][0][umk+1][1][cnt+1],dp[x][m-1][umk][0][cnt]+2);
				}
			}
		}
	}
	
	int cv = 0;
	for (int i=0; i<=n*m; i++) {
		ckmax(cv,dp[n-1][m-1][0][0][i]);
		cout<<n*m*4-2*cv<<" ";
	}
	cout<<"\n";
}

signed main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	
	int t; cin>>t;
	while (t--) solve();
	
}