#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
const int mod = 1e9 + 7;
const int N = 1e6 + 5;
const int inf = 0x3f3f3f3f;


int n, m;
int fa[N];
int find(int x) {
	return fa[x] == x ? x : fa[x] = find(fa[x]);
}
ll ksm(ll x, ll y) {
	ll sum = 1;
	while (y) {
		if (y & 1)sum = x * sum % mod;
		x = x * x % mod;
		y >>= 1;
	}
	return sum;
}
void solve() {
	cin >> n >> m;
	for (int i = 1; i <= 2 * n; i++)fa[i] = i;
	vector<string> a(n + 1);
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		a[i] = ' ' + a[i];
	}
	for (int j = 1; j <= m ; j++) {
		vector<pair<int, int>> e;
		for (int i = 1; i <= n; i++) {
			if (a[i][j] == '1')e.push_back({ i , j });
			if (a[i][m + 1 - j] == '1')e.push_back({ i , m + 1 - j });
		}
		if (e.size() > 2) {
			cout << 0 << endl;
			return;
		}
		if (e.size() == 2 && e[0].first != e[1].first) {
			int u1 = find(e[1].first), v1 = find(e[0].first);
			int u2 = find(e[1].first + n), v2 = find(e[0].first + n);
			if (e[0].second == e[1].second) {
				fa[u1] = v2;
				fa[u2] = v1;
			}
			else {
				fa[u1] = v1;
				fa[u2] = v2;
			}
		}
	}
	ll cnt = 0;
	for (int i = 1; i <= n; i++) {
		int u = find(i), v = find(i + n);
		if (fa[i] == i)cnt++;
		if (fa[i + n] == i + n) cnt++;
		if (u == v) {
			cout << 0 << endl;
			return;
		}
	}
	cnt >>= 1;
	cout << ksm(2, cnt) << endl;
}

signed main() {
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int T = 1;
	cin >> T;
	while (T--)
		solve();
	return 0;
}