#include <bits/stdc++.h>
using namespace std;
#define int long long
#define lowbit(x) (x&-x)
#define endl '\n'

const int mod=1e9+7;
int t,r,c;
vector<vector<int>>a;
vector<vector<pair<int,int>>>v;
vector<vector<pair<int,int>>>v2;
vector<int>flag;
vector<int>zt;
vector<int>empty1;
vector<pair<int,int>>empty2;
int cnt;

void dfs(int id,int z,int fa)
{
	if(flag[id])
	{
		if(flag[id]!=z)
		{
			zt[fa]=0;
		}
		return;
	}
	flag[id]=z;
	for(pair<int,int>i:v2[id])
	{
		dfs(i.first,z^i.second*3,fa);
	}
}

signed main()
{
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>t;
	while(t--)
	{
		a.clear();
		v.clear();
		v2.clear();
		flag.clear();
		zt.clear();
		cin>>r>>c;
		int maxx=max(r,c)+1;
		a.resize(maxx,empty1);
		v.resize(maxx,empty2);
		v2.resize(maxx,empty2);
		flag.resize(maxx,0);
		zt.resize(maxx,2);
		for(int i=1;i<=r;i++)
		{
			a[i].resize(maxx);
			for(int j=1;j<=c;j++)
			{
				char ch;
				cin>>ch;
				a[i][j]=ch-'0';
				if(ch=='1')
				{
					v[min(j,c-j+1)].push_back({i,(j<=r-j+1)});
				}
			}
		}
		bool flag2=false;
		for(int i=1;i<=(c+1>>1);i++)
		{
			if(v[i].size()>2)
			{
				flag2=true;
				break;
			}
			else if(v[i].size()==2)
			{
				pair<int,int>p1=v[i][0],p2=v[i][1];
				int vv=p1.second^p2.second^1;
				v2[p1.first].push_back({p2.first,vv});
				v2[p2.first].push_back({p1.first,vv});
			}
		}
		if(flag2||(c%2==1&&v[c+1>>1].size()>1))
		{
			cout<<"0\n";
			continue;
		}
		int ans=1;
		cnt=0;
		for(int i=1;i<=r;i++)
		{
			if(flag[i]==0)
			{
				dfs(i,1,++cnt);
				ans*=zt[cnt];
				ans%=mod; 
			}
		}
		cout<<ans<<endl;
	}
	return 0;
}
/*

*/