#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl '\n'

int t,r,c;
const int N=1e6+10;
const int M=1e9+7;
int arr[N],tmp[N],judge=0;
char s[N];
map<int,int> mp;
void solve(){
	cin>>r>>c;
	for(int i=0;i<c;++i)arr[i]=0;
	mp.clear();
	int ans=1ll;
	for(int i=1;i<=r;++i){
		if(judge&&t==15759-2380){
			//cout<<r<<"-"<<c<<endl;
			for(int j=1;j<=r;++j){
				cin>>s;
				if(j>=1)cout<<s<<"-";
			}
			exit(0);
		}
		cin>>s;
		int judge=0;
		for(int j=0;j<c;++j)tmp[j]=0;
		for(int j=0;j<c;++j){
			if(s[j]=='1'){
				int kk=c-j-1ll;
				tmp[j]+=1,tmp[kk]+=1;
			}
		}
		map<int,bool> tmp_mp;
		for(int j=0;j<c;++j){
			if(tmp[j]>0&&mp.count(j)==0){
				mp[j]=i;
			}
			else if(tmp[j]&&mp.count(j)){
				tmp_mp[mp[j]]=1;
			}
			arr[j]+=tmp[j];
			if(arr[j]>2)ans=0;
		}
		int cnt=tmp_mp.size();
		if(cnt==0)ans=ans*2%M;
		else if(cnt>=2){
			for(int j=1;j<cnt;++j)ans/=2;
		}
	}
	cout<<ans%M<<endl;
}

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	t=1;
	cin>>t;
	if(t==15759)judge=1;
	while(t--)solve();
	return 0;
}