#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll t,n,m;
vector<ll>shu[1000080];
vector<ll>c[2000090];
ll vis[2000090];
const ll mod=1e9+7;

void bfs(ll u)
{
	vis[u]=1;
	for(auto v:c[u])
	{
		if(vis[v])continue;
		bfs(v);
	}
}

void solve()
{
	cin>>n>>m;
	for(ll i=1;i<=2*n+10;i++)
	{
		vis[i]=0;
		c[i].clear();
	}
	for(ll i=1;i<=m;i++)
	{
		shu[i].clear();
	}
	
	for(ll i=1;i<=n;i++)
	{
		c[i].push_back(i+n);
		c[i+n].push_back(i);
		for(ll j=1;j<=m;j++)
		{
			char a;
			cin>>a;
			if(a=='1')
			{
				shu[j].push_back(i);
			}
		}
	}
	
	if(m%2==1&&shu[m/2+1].size()>1){cout<<0<<endl;return;}
	for(ll i=1;i<=m/2;i++)
	{
		if(shu[i].size()+shu[m-i+1].size()>2){cout<<0<<endl;return ;}
		else if(shu[i].size()+shu[m-i+1].size()<2)continue;
		else{
			if(shu[i].size()==1)
			{
				ll u=shu[i][0];
				ll v=shu[m-i+1][0];
				if(u==v)continue;
				c[u].push_back(v);
				c[u+n].push_back(v+n);
				c[v].push_back(u);
				c[v+n].push_back(u+n);
			}
			else
			{
				ll u,v;
				if(shu[i].size())
				{
					u=shu[i][0];
					v=shu[i][1];
				}
				else 
				{
					u=shu[m-i+1][0];
					v=shu[m-i+1][1];
				}
				c[u].push_back(v+n);
				c[v].push_back(u+n);
				c[u+n].push_back(v);
				c[v+n].push_back(u);
			}
		}
	}
	ll ans=1;
	for(ll i=1;i<=2*n;i++)
	{
		if(!vis[i])
		{
			bfs(i);
			ans*=2;
			ans%=mod;
		}
	}
	cout<<ans<<endl;
	
}
int main()
{
	cin>>t;
	while(t--)
	{
		solve();
	}
}