#include "bits/stdc++.h"
using namespace std;
const int Len = 1e6 + 5 , mod = 1e9 + 7;
int head[Len],cnt,col[Len];
struct node
{
	int next,to;
}edge[Len << 1];
inline void add(int from,int to)
{
	edge[++ cnt].to = to;
	edge[cnt].next = head[from];
	head[from] = cnt;
}
int ans,fa[Len << 1],flg[Len],flw[Len],N,n,m;
inline void makeSet(int x){cnt = 0;for(int i = 1 ; i <= x ; i ++) flg[i] = col[i] = head[i] = flw[i] = 0 , fa[i] = i;}
int findSet(int x){return fa[x] == x ? fa[x] : fa[x] = findSet(fa[x]);}
inline int swp(int x){if(x > n) return x - n;return x + n;}
inline void unionSet(int x,int y)
{
	if(x == y) return;
	add(x , y) , add(y , x);
	int u = findSet(x) , v = findSet(y);
	if(u != v) fa[u] = v;
	u = findSet(swp(x)) , v = findSet(swp(y));
	if(u != v) fa[u] = v;
}
inline void UnionSet(int x,int y)
{
	if(x == y) return;
	int u = findSet(x) , v = findSet(y);
	if(u != v) fa[u] = v;
}
vector<int> vc[Len];
char s[Len];
void dfs(int x)
{
	for(int e = head[x] ; e ; e = edge[e].next)
	{
		int to = edge[e].to;
		if(flg[to]) 
		{
			if(col[to] == col[x]) ans = 0;
			continue;
		}
		flg[to] = 1 , col[to] = 3 - col[x];
		dfs(to);
	}
}
signed main()
{
	int T;scanf("%d",&T);
	while(T --)
	{
		scanf("%d %d",&n,&m);ans = 1;
		for(int i = 1 ; i <= m ; i ++)
		{
			vector<int> clr;
			swap(clr , vc[i]);
		}
		for(int i = 1 ; i <= n ; i ++)
		{
			scanf("%s",s + 1);
			for(int j = 1 ; j <= m ; j ++) if(s[j] == '1') vc[j].push_back(i);
		}
		N = (n << 1);
		makeSet(N);
		for(int i = 1 ; i <= m / 2 + (m % 2) ; i ++)
		{
			int SZ = (int)vc[i].size() + (i != m - i + 1) * (int)vc[m - i + 1].size();
			if(SZ >= 3 || (i == m - i + 1 && SZ >= 2)) ans = 0;
			else if(SZ == 2)
			{
				//printf("#%d\n",i);
				if((int)vc[i].size() == 2) unionSet(vc[i][0] , vc[i][1]);
				else if((int)vc[m - i + 1].size() == 2) unionSet(vc[m - i + 1][0] , vc[m - i + 1][1]);
				else unionSet(swp(vc[m - i + 1][0]) , vc[i][0]);
			}
		}
		for(int i = 1 ; i <= N ; i ++) 
		{
			if(flg[i]) continue;
			flg[i] = col[i] = 1;
			dfs(i);
		}
		for(int i = 1 ; i <= n ; i ++) fa[i] = i , flw[i] = 0;
		for(int i = 1 ; i <= m / 2 + (m % 2) ; i ++)
		{
			int SZ = (int)vc[i].size() + (i != m - i + 1) * (int)vc[m - i + 1].size();
			if(SZ >= 3 || (i == m - i + 1 && SZ >= 2)) ans = 0;
			else if(SZ == 2)
			{
				//printf("#%d\n",i);
				if((int)vc[i].size() == 2) UnionSet(vc[i][0] , vc[i][1]);
				else if((int)vc[m - i + 1].size() == 2) UnionSet(vc[m - i + 1][0] , vc[m - i + 1][1]);
				else UnionSet(vc[m - i + 1][0] , vc[i][0]);
			}
		}
		for(int i = 1 ; i <= n ; i ++) 
		{
			int f = findSet(i);
			if(flw[f]) continue;
			flw[f] = 1;
			ans = 1ll * ans * 2 % mod;
		}
		printf("%d\n",ans);
	}
	return 0;
}