#include <bits/stdc++.h>
using namespace std;

#define sz(a) (int)(a.size())
#define ll long long

vector < vector <pair <int, int> > >adj;

void addedge(int x, int y, int e) {
	adj[x].push_back({y, e});
	adj[y].push_back({x, e});
}

int colored[1000006];

bool dfs(int x) {
	bool ok = 1;
	for(auto [v, e]: adj[x]) {
		if(colored[v] != -1 && colored[v] != (colored[x] ^ e)) {
			ok = 0;
			break;
		}
		if(colored[v] == -1) {
			colored[v] = colored[x] ^ e;
			ok &= dfs(v);
		}
	}
	return ok;
}

vector < vector <int> > tmp;
string s[1000006];
int r, c, MOD = 1e9 + 7;
vector < vector <bool> > dd;

void solve() {
	cin >> r >> c;
	tmp.clear();
	tmp.resize(c + 5);
    dd.clear();
    dd.resize(r + 5, vector <bool> (c + 5, 0));

	int mid = c / 2 + c % 2;
	for(int i = 0; i < r; ++i) {
		cin >> s[i];
		for(int j = 0; j < mid; ++j) {
			if(s[i][j] == '1' || s[i][c - j - 1] == '1') {
				tmp[j].push_back(i);
			}
			if(s[i][j] == '1' && s[i][c - j - 1] == '1') {
				dd[i][j] = 1;
			}
		}
	}

	for(int i = 0; i < mid; ++i) {
		if(sz(tmp[i]) > 2) {
			cout << 0 << '\n';
			return;
		}
		if(sz(tmp[i]) == 2 && (dd[tmp[i][0]][i] || dd[tmp[i][1]][i])) {
			cout << 0 << '\n';
			return;
		}
	}

	adj.clear();
	adj.resize(r + 5);
	for(int i = 0; i < mid; ++i) {
		if(sz(tmp[i]) == 2) {
			if((s[tmp[i][0]][i] == '1' && s[tmp[i][1]][i] == '0') || (s[tmp[i][0]][i] == '0' && s[tmp[i][1]][i] == '1')) {
				addedge(tmp[i][0], tmp[i][1], 0);
			}
			else {
				addedge(tmp[i][0], tmp[i][1], 1);
			}
		}
	}
	for(int i = 0; i < r; ++i) colored[i] = -1;

	ll res = 1;
	for(int i = 0; i < r; ++i) {
		if(colored[i] == -1) {
			colored[i] = 0;
			if(dfs(i)) {
				res = res * 2 % MOD;
			}
			else {
				res = 0;
				break;
			}
		}
	}
	cout << res << '\n';
}

int main()
{
	ios_base :: sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int T;
	cin >> T;
	while(T--) {
		solve();
	}
	return 0;
}