#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1e9 + 7,N=2e6+10;
string mp[N];
int p[N];
int qsumi(int a,int b){
	int res=1;
	while(b){
		if(b&1) res=res*a%mod;
		b>>=1;
		a=a*a%mod;
	}
	return res;
}
int find(int x) {
	if (p[x]==x) {
		return x;
	}
	return p[x]=find(p[x]);
}
void unionn(int x,int y) {
	x=find(x);
	y=find(y);
	if (x==y) {
		return;
	}
	p[x]=y;
}
void solve()
{
	int n,m;
	cin>>n>>m;
	//vector<int>p(2*n+10); 
	for(int i=1;i<=2*n+1;i++) p[i]=i;
//	vector<vector<char>>mp(n+10,vector<char>(m+10));
	for(int i=1;i<=n;i++){
		cin>>mp[i];
		mp[i]=" "+mp[i];
	}
	vector<int>cnt(m+1,0);
    vector<int>v[2*m];
	for (int i=1; i<=n; i++) {
		for (int j=1; j<=m; j++) {
			if (mp[i][j]=='1') {
				cnt[j]++;
				v[j].push_back(i);
			}
		}
	}
	if (m&1) {
		if (v[(m+1)/2].size()>=2) {
			cout<<"0\n";
			return;
		}
	}
	for(int i=1;i<=m/2;i++){
		int ot=m-i+1;
		int c1=v[i].size(),c2=v[ot].size();
		int sum=c1+c2;
		if(sum>2){
			cout<<0<<'\n';
			return;
		}
		if(sum<2) continue;
		int r1,r2;
		if(c1==c2) r1=v[i][0],r2=v[ot][0];
		else{
			int cur=i;
			if(c1<c2) swap(cur,ot);
			r1=v[cur][0],r2=v[cur][1];
		}
		if(r1==r2){
			continue;
		}
		int r11=r1+n,r22=r2+n;
		unionn(r1,r22),unionn(r2,r11); 
	}
	int ans=0;
	for (int i=1; i<=n; i++) {
		if (find(i)==find(i+n)) {
//			cout<<i<<"****"<<"\n";
			cout<<"0\n";
			return;
		}

	}
	for (int i=1; i<=2*n; i++) {
		find(i);
		if (p[i]==i) {
			ans+=1;
		}
	}
	cout<<qsumi(2,ans/2)%mod<<'\n';
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int t;
	cin>>t;
	while(t--) solve();
	return 0;
}