#define TLE ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include "../template/debug.h"
#else 
#define dbg(...) ;
#endif
using ll =long long;
#define int ll
#define inf 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,n,a) for (int i=n;i>=a;i--)
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
#define pb push_back
typedef pair<int,int> PII;
const int mod=1e9+7;
// const int mod=998244353;
typedef double db;
mt19937 rnd(time(0));
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
const int N = 1e6+5;
vector<int >v1[N];
int n,m;
int fa[N];
int find(int x){
	if(x==fa[x]) return x;
	return fa[x]=find(fa[x]);
}
void solve(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		string s;
		cin>>s;
		// cout<<s<<'\n';
		for(int j=0;j<SZ(s);j++){
			int p=s[j]-'0';
			// cout<<p<<'\n';
			if(p){
				v1[j+1].push_back(i);
			}
		}
	}
	for(int i=1;i<=m;i++){
		if(SZ(v1[i])<=1) continue;
		if(v1[i].size()>2) {
			cout<<0<<'\n';
			return ;
		}
		if(!v1[m-i+1].empty()){
			cout<<0<<'\n';
			return ;
		}
	}
	for(int i=1;i<=n;i++){
		fa[i]=i;
	}
	for(int i=1;i<=m;i++){
		if(v1[i].empty()) continue;
		int x,y;
		if(v1[i].size()==1){
			x=v1[i][0];
			if(v1[m-i+1].size()==1){
				y=v1[m-i+1][0];
			}
			else{
				continue;
			}
		}
		else{
			x=v1[i][0];
			y=v1[i][1];
		}
		// cout<<x<<' '<<y<<'\n';
		int u=find(x);
		int v=find(y);
		if(u!=v){
			fa[u]=v;
		}
	}
	int ans=1;
	for(int i=1;i<=n;i++) {
		if(i==find(i)) {
			ans*=2;
			ans%=mod;
		}
	}
	cout<<ans<<'\n';
}
void clear(){
	for(int i=1;i<=m;i++) v1[i].clear();
}
signed main(){
	TLE;
	int t;
	cin>>t;
	while(t--){
		solve();
		clear();
	}
	return 0;
}