#include <bits/stdc++.h>/////奇数要处理 
using namespace std;
const long long MOD = 1e9 + 7;
const int N = 1e6 + 10;
int T;
vector <int> v[N];
int n,m;
string s;
vector <int> p[N];
map <int,int> mp;
int vis[N];
struct edge
{
	int id;
	int val;
};
queue <edge> q;
int vis_point[N];
int bfs(int x)
{
	while(!q.empty())q.pop();
	vis[x] = 1;
	int siz = v[x].size();
	for(int i = 0;i < siz;i++)
		q.push({x,v[x][i]});
	int flag = 1;
	while(!q.empty())
	{
		if(!flag)break;
		edge u = q.front();
		vis_point[u.val] = 1;
		vis[u.id] = 1;
		q.pop();
		int ts = p[u.val].size();
		if(ts == 1){
			if(!flag)break;
			continue;
		}
		if(ts == 2){
			if(!flag)break;
			int pp = p[u.val][0] + p[u.val][1] - u.id;
			if(!vis[pp])
			{
				vis[pp] = 1;
				int id = lower_bound(v[pp].begin(),v[pp].end(),u.val) - v[pp].begin();	
				if(v[pp][id] != u.val){
					int tz = v[pp].size();
					for(int i = 0;i < tz;i++)
					{
						if(vis_point[v[pp][i]]){
							flag = 0;
							break;
						}
						else
						{
							vis_point[v[pp][i]] = 1;
							q.push({pp,v[pp][i]});
						}
					}
				}
				else
				{
					int tz = v[pp].size();
					for(int i = 0;i < tz;i++)
					{
						int xx = (m + 1) - v[pp][i];
						if(vis_point[xx]){
							flag = 0;
							break;
						}
						else
						{
							vis_point[xx] = 1;
							q.push({pp,xx});
						}
					}
				}
			}  
		}
	}
	if(!flag || !q.empty())return 0;
	else return 1;
}
long long qpow(int x)
{
	long long ret = 1,k = 2;
	while(x)
	{
		if(x % 2 == 1)
			ret *= k,ret %= MOD;
		x /= 2;
		k *= k;
		k %= MOD;
	}
	return ret;
}
void init(int x,int y)
{
	for(int i = 0;i <= x;i++)
		{
			vis[i] = 0;
			v[i].clear();
		}
		for(int i = 0;i <=y;i++)
		{
			vis_point[i] = 0;
			p[i].clear();
		}
}
int main()
{
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin >> T;
	while(T--)
	{
		int cnt = 0;
		cin >> n >> m;
		for(int i = 1;i <= n;i++){
			cin >> s;
			for(int j = 0;j < m;j++)
			{
				if(s[j] == '1'){
					if(m % 2 == 1 && j + 1 == m / 2 + 1){
						cnt++;
					}
					else{
					v[i].push_back(j + 1);
					p[j + 1].push_back(i);
					p[(m + 1) - (j + 1)].push_back(i);}
				}
			}
		}
		if(cnt > 1){
			cout << 0 << endl;
			init(n,m);
			continue;
		}
		int flag = 1;
		//cout << "fuck you data" << endl;
		for(int i = 1;i <= m;i++)
		{	
			if(p[i].size() > 2){
				//cout << i << " " << p[i].size() << endl;
				//for(int j = 0;j < p[i].size();j++)cout << p[i][j] << " ";
				//cout << endl;
				flag = 0;
				break;
			}
		}	
		if(!flag){
			cout << 0 << endl;
			init(n,m); 
			continue;
		}
		int ans = 0;
		//cout << "fuck you data" << endl;
		for(int i = 1;i <= n;i++)
		{
			if(!vis[i]){
				int pd = bfs(i);
				if(pd)ans++;
				else {
					ans = -1;
					break;
				}
			}
		}
		if(!flag){
			cout << 0 << endl;
			init(n,m);
			continue;
		}
		if(ans == -1)cout << 0 << endl;
		else cout << qpow(ans) << endl;
		init(n,m);
	}	
	return 0;
}