// #pragma GCC optimize(2)
// #pragma GCC optimize(3,"Ofrrst","inline")
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define ll long long
#define endl '\n'
#define ull unsigned long long
#define ll __int128_t
#define fre freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
mt19937 rd(chrono::system_clock::now().time_since_epoch().count());
const int mod=1e9 + 7;
const int inf=0x3f3f3f3f3f3f3f3f;
const int N=2e5+10;
const double eps=1e-6;
const int hash_p1=1610612741;
const int hash_p2=805306457;
const int hash_p3=402653189;
const int base_1=131;
const int base_2=13331;
#define pre(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,a,b) for(int i=a;i>=b;i--)
int n,m,f[N];
bool st[N];
int find(int x)
{
	if(x != f[x])
		return f[x] = find(f[x]);
	return f[x];
}
void merge(int a,int b)
{
	int fa = find(a),fb = find(b);
	// if(fa == fa) return ;
	f[fa] = fb;
	return ;
}
int qmi(int a,int b)
{
	ll res = 1;
	while(b)
	{
		if(b & 1) res = (ll)res * a % mod;
		a = (ll)a * a % mod;
		b >>= 1ll;
	}
	return res;
}
void solve()
{
	cin >> n >> m;
	vector<vector<int>> ve(m + 1);//当前列是 1 的行数
	//每一列及其对称列最多有两个行
	pre(i,1,2 * n) f[i] = i,st[i] = 0;
	pre(i,1,n)
	{
		pre(j,1,m)
		{
			char c;cin >> c;
			if(c == '1') ve[j].push_back(i);
		}
	}
	pre(i,1,m)
	{
		if(ve[i].size() + ve[m - i + 1].size() > 2)
		{
			cout << 0 << endl;
			return ;
		}
	}
	//原字符串 S 反转后的字符串 T , 
	pre(i,1,m / 2)
	{
		if(ve[i].size() == 2)//两行链接在一起
		{
			merge(ve[i][0],ve[i][1] + n);
			merge(ve[i][0] + n,ve[i][1]);
		}
		else if(ve[m - i + 1].size() == 2)
		{
			merge(ve[m - i + 1][0],ve[m - i + 1][1] + n);
			merge(ve[m - i + 1][0] + n,ve[m - i + 1][1]);
		}
		else if(ve[i].size() + ve[m - i + 1].size() == 2)
		{
			merge(ve[i][0],ve[m - i + 1][0]);
			merge(ve[i][0] + n,ve[m - i + 1][0] + n);
		}
	}
	pre(i,1,n)
	{
		if(find(i) == find(n + i))
		{
			cout << 0 << endl;
			return ;
		}
	}
	ll ans = 0;
	// map<int,int> mp;
	pre(i,1,2 * n)
	{
		int tp = find(i);
		if(!st[tp])
			ans ++ ,st[tp] = 1;
	}
	ans /= 2;
	cout << qmi(2,ans)  << endl;
}
//#define LOCAL
signed main(){
	ios
	//fre
	#ifdef LOCAL
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
	auto start = std::chrono::high_resolution_clock::now();
	#endif
	
	int _=1;
	cin>>_;
	while(_--)solve();
	
	#ifdef LOCAL
	auto end = std::chrono::high_resolution_clock::now();
	cout << "Execution time: "
		 << std::chrono::duration_cast<std::chrono::milliseconds>(end - start).count()
		 << " ms" << '\n';
	#endif
	return 0;
}