#include <bits/stdc++.h>
#define inf 1000000007
#define mod 1000000007
// #define int long long
// #pragma GCC optimize("Ofast","inline","-ffast-math")
// #pragma GCC target("avx,sse2,sse3,sse4,mmx")
using namespace std;
template <typename T> void read(T &x){
	x=0;char ch=getchar();int fh=1;
	while (ch<'0'||ch>'9'){if (ch=='-')fh=-1;ch=getchar();}
	while (ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
	x*=fh;
}
template <typename T> void write(T x) {
	if (x<0) x=-x,putchar('-');
	if (x>9) write(x/10);
	putchar(x%10+'0');
}
template <typename T> void writeln(T x) {
	write(x);
	puts("");
}
int n,m;
int a[1000005];
char b[1000010];
vector<int> id[1000005];
vector<pair<int,int>> g[1000005];
int dist[1000005];
signed main()
{
	// freopen(".in","r",stdin);
	// freopen(".out","w",stdout);
	int tc;read(tc);
	while(tc--)
	{
		read(n);read(m);
		for(int i=1;i<=n;++i)
		{
			scanf("%s",b+1);
			for(int j=1;j<=m;++j)
				a[(i-1)*m+j]=b[j]-'0';
		}
		for(int i=1;i<=m;++i)
			id[i].clear();
		for(int i=1;i<=n;++i)
			for(int j=1;j<=m;++j)
				if(a[(i-1)*m+j])
					id[j].push_back(i);
		for(int i=1;i<=n;++i)
			g[i].clear();
		bool flag=1;
		for(int i=1;i<=m+1-i;++i)
		{
			if(i==m+1-i)
			{
				if(id[i].size()>1) flag=0;
				continue;
			}
			if(id[i].size()+id[m+1-i].size()>2) {flag=0;break;}
			set<int> st;
			for(int j:id[i]) st.insert(j);
			for(int j:id[m+1-i]) st.insert(j);
			if(st.size()<2) continue;
			int a=*st.begin(),b=*st.rbegin();
			if(id[i].size()==1)
			{
				g[a].push_back({b,0});
				g[b].push_back({a,0});
			}
			else
			{
				g[a].push_back({b,1});
				g[b].push_back({a,1});
			}
		}
		if(!flag) {puts("0");continue;}
		for(int i=1;i<=n;++i) dist[i]=-1;
		int ans=1;
		for(int i=1;i<=n;++i)
			if(dist[i]==-1)
			{
				ans=2ll*ans%mod;
				queue<int> q;
				q.push(i);
				dist[i]=0;
				while(!q.empty())
				{
					int u=q.front();q.pop();
					for(auto [v,w]:g[u])
						if(dist[v]==-1)
						{
							dist[v]=(dist[u]+w)%2;
							q.push(v);
						}
				}
			}
		for(int u=1;u<=n;++u)
			for(auto [v,w]:g[u])
				if((dist[u]+w)%2!=dist[v]) ans=0;
		writeln(ans);
	}
	return 0;
}