#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> PII;
const int mod=1e9+7;
const int N = 1000010;
int p[N];
long long power(int a, int b){
	long long res = 1;
	while (b){
		if (b & 1) res = res * a % mod;
		b >>= 1;
		a = a * a % mod;
		
	}
	return res;
}
int find(int x)
{
	if(x!=p[x]) p[x]=find(p[x]);
	return p[x];
}
void solve()
{
	int r,c,ans=0,a[N]={0},b[N]={0};
	cin>>r>>c;
	string s[r+10];
	for(int i=1;i<=r;i++) p[i]=i;
	for(int i=1;i<=r;i++) {
		cin>>s[i];
		s[i]=" "+s[i];
		for(int j=1;j<=c;j++) {
			if(s[i][j]=='1') {
				a[j]++;a[c-j+1]++;
				if(a[j]>2||a[c-j+1]>2) {
					cout<<0<<endl;
					return ;
				}
				if(b[j]==0&&b[c-j+1]==0) {
					b[j]=i;
					b[c-j+1]=i;
				}else {
					int x=find(b[j]),y=find(i);
					if(x!=y) {
						p[y]=find(p[x]);
					}
				}
			}
		}
	}
	for(int i=1;i<=r;i++) {
		if(p[i]==i) ans++,p[i]=0;
	}
	cout<<power(2,ans)<<endl;
}
int main()
{
    int t = 1;
    cin >> t;
    std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

    while (t--)
        solve();
    
    return 0;
}