#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
const int mod = 1e9 + 7;
bool chmin(int &x, int y) {
	if (x > y) {
		x = y;
		return 1;
	}
	return 0;
}
bool chmax(int &x, int y) {
	if (x < y) {
		x = y;
		return 1;
	}
	return 0;
}

void solve() {
	int n, m;
	cin >> n >> m;
	vector<string>g(n);
	for (int i = 0; i < n; i ++) {
		cin >> g[i];
	}
	vector<int> cnt(m);
	for (int i = 0; i < n; i ++) {
		for (int j = 0; j < m; j ++) {
			if (g[i][j] == '1') {
				cnt[j] ++;
				cnt[m - j - 1] ++;
			}
		}
	}
	ll ans = 1;

	for (int i = 0; i < m; i ++) {
		if (cnt[i] > 2) {
			cout << 0 << '\n';
			return;
		}
	}

	vector<int> done1(m), done2(m);
	for (int i = 0; i < n; i ++) {
		bool ok = 1;
		for (int j = 0; j < m; j ++) {
			if (g[i][j] == '1') {
				if (done1[j] || done1[m - j  -1]) {
					ok = 0;
				} else {
					done2[j] = 1;
					if (g[i][m - j - 1] != '1') done2[m - j - 1] = 1;
				}
			}
		}
		done1 = done2;
		if (ok) ans = ans * 2 % mod;
		//cout << ans << '\n';
	} 
	cout << ans << '\n';

}

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

	return 0;
}