#include<iostream>
#include<cmath>
using namespace std;
bool isPrime(int a) {
	if (a == 1) {
		return false;
	}
	else {
		for (int i = 2; i * i <= a; i++) {
			if (a % i == 0) {
				return false;
			}
		}
		return true;
	}
}
int main() {
	int T, n, m, i, j, t;
	int a[210][210], ans[210][210] = { 0 };

	cin >> T;
	for (t = 0; t < T; t++) {
		cin >> n >> m;
		for (i = 1; i <= n; i++) {
			for (j = 1; j <= m; j++) {
				cin >> a[i][j];
				if (isPrime(a[i][j])) {
					ans[i][j] = ans[i - 1][j] + 1;
				}
				//else{ans[i][j]=0;}
			}
		}
		
		for (i = 1; i <= n; i++) {
			for (j = 1; j <= m; j++) {
				cout<<ans[i][j]<<" ";
			}
			cout<<endl;
		}
	}
	

	return 0;
}