#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int>v[2000050];
int sumc[2000050]={0};
int root[2000050]={0};
int find(int x){
	if(x!=root[x]){
		root[x]=find(root[x]);
	}
	return root[x];
}
void merge(int a,int b){
	int ra=find(a);
	int rb=find(b);
	root[ra]=root[rb];
	return ;
}
void solve(){
	int r,c;
	scanf("%d %d",&r,&c);
	for(int i=1;i<=c;i++){sumc[i]=0;}
	for(int i=1;i<=2*max(r,c);i++){
		v[i].clear();
	}
	for(int i=1;i<=r;i++){
		string s;
		cin>>s;
		for(int j=1;j<=c;j++){
			int tem=(int)s[j-1]-48;
			sumc[j]+=tem;
			if(tem==1){
				v[j].push_back(i);//列的1的行
			}
		}
	}
	for(int i=1;i<=c;i++){
		if(sumc[i]+sumc[c-i+1]>2){
			printf("0");
			return ;
		}
	}
	for(int i=1;i<=2*max(r,c);i++){
		root[i]=i;
	}
	for(int i=1;i<=c;i++){
		if(sumc[i]+sumc[c-i+1]==2){
			if(sumc[i]==0) continue;
			if(sumc[i]==1){//相同
				merge(v[c-i+1][0],v[i][0]);
				merge(v[c-i+1][0]+r,v[i][0]+r);
			}else{//相反
				merge(v[i][1],v[i][0]+r);
				merge(v[i][1]+r,v[i][0]);
			}
		}
	}
	set<int>s;
	for(int i=1;i<=2*r;i++){
		if(find(i)==find(i+r)){
			printf("0");return;
		}
		s.insert(find(i));
	}
	ll siz=s.size()/2;
	ll ans=1;
	while(siz){
		ans*=2;
		ans%=1000000007;
		siz--;
	}
	printf("%lld",ans);
	
}
int main(){ 
	int t;
	scanf("%d",&t);
	while(t--){
		solve();
		if(t) printf("\n");
	}	
	
	
	return 0;
}