#include <bits/stdc++.h>
using namespace std;
void solve() {
	int n, m;
	cin >> n >> m;

	string ss;
	int i, j;
	vector<vector<int>> nxt(m + 4);
	vector<vector<int>> node(n + n + 3);
	bool flag = true;
	for(i = 1; i <= n; ++i) {
		cin >> ss;
		ss = ' ' + ss;
		if(!flag) {
			continue;
		}
		for(j = 1; j <= m; ++j) {
			if(ss[j] == '1') {
				nxt[j].push_back(i);
				if(j != m - j + 1) {
					if(nxt[j].size() + nxt[m - j + 1].size() >= 3) {
						flag = false;
					}
					if(flag) {
						for(auto & v : nxt[j]) {
							if(v == i)
								continue;
							node[v + n].push_back(i);
							node[i].push_back(v + n);
							node[i + n].push_back(v);
							node[v].push_back(i + n);
						}
						for(auto & v : nxt[m - j + 1]) {
							if(v == i)
								continue;
							node[v].push_back(i);
							node[i].push_back(v);
							node[v + n].push_back(i + n);
							node[i + n].push_back(v + n);
						}
					}
				}else {
					if(nxt[j].size() >= 2) {
						flag = false;
					}
				}
			}
		}
	}
	if(!flag) {
		cout << "0\n";
		return;
	}
	vector<int> dfn(n + n + 3, 0);
	int cnt = 0;
	function<void(int,int)> dfs = [&] (int u, int fa) {
		if(fa > 0)
			dfn[u] = dfn[fa];
		for(auto & v : node[u]) {
			if(v != fa) {
				dfs(v, u);
			}
		}
	};
	for(i = 1; i <= n + n; ++i) {
		if(dfn[i] == 0) {
			dfn[i] = ++cnt;
			dfs(i, -1);
		}
	}
	// cout << "miao\n";
	// for(i = 1; i <= n; ++i) {
	// 	cout << dfn[i] << " \n"[i == n];
	// }
	// for(i = 1; i <= n; ++i) {
	// 	cout << dfn[i + n] << " \n"[i == n];
	// }
	for(i = 1; i <= n; ++i) {
		if(dfn[i] == dfn[i + n]) {
			flag = false;
			break;
		}
	}
	if(flag) {
		const int mod = 1e9 + 7;
		auto qpow = [&] (int x, int q, int mod) {
			int ret = 1;
			while(q > 0) {
				if(q & 1) {
					ret = (1ll * ret * x) % mod;
				}
				x = (1ll * x * x) % mod;
				q >>= 1;
			}
			return ret;
		};
		cout << qpow(2, cnt >> 1, mod) << "\n";
	}else {
		cout << "0\n";
	}
	return;
}
int main() {
	int t;
	cin >> t;
	while(t--)
		solve();
	return 0;
}