#include<bits/stdc++.h>
using namespace std;
#define M 2000005
#define P 1000000007
vector<int>d[M],g[M];
int pt1[M],pt2[M],mk[M],flag=0,sz[M];
void dfs(int x){
	for(int i=0;i<(int)g[x].size();++i){
		int v=g[x][i];
		if(!mk[v]){
			mk[v]=2-mk[x]+1;
			dfs(v);
		}else if(mk[v]!=2-mk[x]+1)flag=1;
	}
}
int pw(int x,int p){
	int ans=1;
	while(p){
		if(p&1)ans=1ll*ans*x%P;
		x=1ll*x*x%P;p>>=1;
	}
	return ans;
}
void solve(){
	int n,m;
	scanf("%d%d",&n,&m);
	for(int i=0;i<n;++i){
		d[i].resize(m);
		for(int j=0;j<m;++j)
			scanf("%01d",&d[i][j]);
	}
	for(int i=0;i<n;++i)g[i].clear(),mk[i]=0,flag=0;
	for(int i=0;i<m;++i){
		pt1[i]=-1,pt2[i]=-1;sz[i]=0;
		for(int j=0;j<n;++j)if(d[j][i]){
			if(pt1[i]==-1)pt1[i]=j,sz[i]++;
			else if(pt2[i]==-1)pt2[i]=j,sz[i]++;
			else{
				puts("0");
				return;
			}
		}
	}
	if((m&1)&&sz[m/2]==2){
		puts("0");
		return;
	}
	int cnt=n-1;
	for(int i=0;i<m-i-1;++i){
		if(sz[i]+sz[m-i-1]>2){
			puts("0");
			return;
		}
		int p=i;
		if(sz[m-i-1]==2)p=m-i-1;
		if(sz[p]==2){
			g[pt1[p]].push_back(pt2[p]);
			g[pt2[p]].push_back(pt1[p]);
		}else if(sz[p]==1&&sz[m-p-1]==1){
			g[pt1[p]].push_back(++cnt);
			g[cnt].clear();
			g[cnt].push_back(pt1[p]);
			g[pt1[m-p-1]].push_back(cnt);
			g[cnt].push_back(pt1[m-p-1]);
		}
	}
	int ans=0;
	for(int i=0;i<n;++i)if(!mk[i])mk[i]=1,dfs(i),ans++;
	if(flag)puts("0");
	else printf("%d\n",pw(2,ans));
}
int main(){
	int t;                   
	scanf("%d",&t);
	while(t--)solve();
}