#include<bits/stdc++.h>
using namespace std;
const int MAX=1e6+5;
const long long MOD=1e9+7;
vector<int> g[MAX];
struct edge{
	int nxt,to;
};
edge e[MAX];
int n,m,tot,h[MAX];
string s;
int dfn[MAX],cur;
bool vis[MAX],res;
// 快读 
void addedge(int u,int v){
	e[++tot].to=v;
	e[tot].nxt=h[u];
	h[u]=tot;
}
int read(){
	int x = 0, f = 1;
	char c = getchar();
	while(c < '0' || c > '9'){
		if(c == '-'){
			f = -1;
		}
		c = getchar();
	}
	while(c >= '0' && c <= '9'){
		x = x*10+c-'0';
		c = getchar();
	}
	return x*f;
}
void dfs(int u){
	vis[u]=1;
	for(int i=h[u];i;i=e[i].nxt){
		int v=e[i].to;
		if(!vis[v]){
			dfn[v]=dfn[u]^1;
			dfs(v);
		}
		else{
			if(dfn[u]==dfn[v]){
				res=0;
				return;
			}
		}
	}
}
void solve(){
	tot=0;
	n=read(),m=read();
	memset(vis,0,sizeof(bool)*(n+1));
	memset(dfn,0,sizeof(int)*(n+1));
	memset(h,0,sizeof(int)*(n+1));	
	int mid=m/2;
	for(int i=1;i<=mid;++i){
		g[i].clear();
	}	
	if(m%2)
		mid++;
	for(int i=1;i<=n;++i){
		cin>>s;
		for(int j=1;j<=m;++j){
			if(s[j-1]=='1'){
				if(j<=mid)
					g[j].push_back(i);
				else
					g[m-j+1].push_back(i);
			}
		}
	}
	for(int i=1;i<=mid;++i){
		if((int)g[i].size()<=1)
			continue;
		if((int)g[i].size()>=3){
			printf("0\n");
			return;
		}
		if((int)g[i].size()==2){
			if(g[i][0]!=g[i][1]){
			//	cout<<g[i][0]<<" "<<g[i][1]<<endl;
				addedge(g[i][0],g[i][1]);
				addedge(g[i][1],g[i][0]);	
			}			
		}
	}
//	cout<<"**"<<endl;
	long long ans=1;
	for(int i=1;i<=n;++i){
		if(!vis[i]){
			ans=ans*2%MOD;
			res=0;
			dfs(i);
			if(res){
				printf("0\n");
				return;
			}
		}
	}	
	printf("%lld\n",ans);	
}
int main(){
	int T;
	cin>>T;
	while(T--){
		solve();
	}
}