#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define endl '\n'

const int N = 2e6+5;
const int MOD = 1e9+7;
 
vector<ll> vj[N];

ll pre[N];

ll qmi(ll a,ll k,ll p){
	ll res = 1%p;
	while(k){
		if(k&1) res = 1LL*res*a%p;
		k >>= 1;
		a = 1LL*a*a%p;
	}
	return res;
}

ll root(ll x){
	return pre[x]=pre[x]==x ? x : root(pre[x]); 
}

void merge(ll x,ll y){
	x=root(x),y=root(y);
	if(x==y) return;
	pre[x]=y;
} 

void solve(){
	ll n,m;
	string s;
	cin>>n>>m;
	for(int i=0;i<=m+1;i++) vj[i].clear();
	for(int i=1;i<=n;i++){
		cin>>s;
		for(int j=0;j<m;j++){
			if(s[j] == '1'){
				vj[j].push_back(i);
				if(j != m-j-1) vj[m-j-1].push_back(n+i);
			}
		}
	}
	for(int i=1;i<=2*n;i++) pre[i] = i;
	//for(int i=0;i<m;i++) cout<<vj[i].size()<<' ';
	//cout<<endl;
	for(int i=0;i<m;i++){
		if(vj[i].size() >= 3){
			cout<<0<<endl;
			return;
		}
		else if(vj[i].size() >= 2 && i == m/2 && m%2 == 1){
			cout<<0<<endl;
			return;
		}
		else{
			if(vj[i].size()){
				ll now = vj[i][0];
				for(auto &j:vj[m-1-i]) if(j != now+n && j != now-n) merge(j,now);
				//for(auto &j:vj[m-1-i]) merge(j,now);
			}
			else if(vj[m-1-i].size()){
				ll now = vj[m-1-i][0];
				for(auto &j:vj[i]) if(j != now+n && j != now-n) merge(j,now);
				//for(auto &j:vj[m-1-i]) merge(j,now);
			}
		}
	}
	map<ll,ll> mp;
	ll cnt = 0;
	//for(int i=1;i<=2*n;i++) cout<<root(i)<<' ';
	//cout<<endl;
	for(int i=1;i<=n;i++){
		if(root(i) == root(n+i)){
			cout<<0<<endl;
			return;
		}
	}
	for(int i=1;i<=2*n;i++){
		if(!mp.count(root(i))){
			mp.insert({root(i),1});
			cnt++;
		}
		else mp[root(i)]++; 
	}
	ll ans = 0;
	ans = qmi(2,cnt/2,MOD)%MOD;
	cout<<ans<<endl;
}

int main(){
	ios;
	ll T;cin>>T;while(T--)
	solve();
	return 0;
}