#include<bits/stdc++.h>

std::string s[1000007];
int djs[2000007];
std::vector<int>v[1000007];

int find(int x)
{
	if(djs[x] == x)
		return x;
	return find(djs[x]);
}
void merge(int x,int y)
{
	x = find(x);
	y = find(y);
	djs[x] = y;
}
int main()
{
	int Cases;
	std::cin >> Cases;
	while (Cases--)
	{
		int r, c;
		bool flag = true;
		std::cin >> r >> c;
		for(int i = 1; i <= r; i++)
			std::cin >> s[i];
		for(int i = 1; i <= r + r; i++)
			djs[i] = i;
		for(int j = 0; j < c; j++)
			v[j].clear();
		if(c & 1)
		{
			int mid = (c - 1) >> 1;
			int cnt = 0;
			for(int i = 1; i <= r; i++)
			{
				if(s[i][mid] == '1')
				{
					++cnt;
				}
			}
			if(cnt > 1)
			{
				puts("0");
				continue;
			}
		}
		for(int j = 0; j < c; j++)
		{
			if(c & 1 && j == ((c-1) >> 1) )
				continue;
			for(int i = 1; i <= r; i++)
			{
				if(s[i][j] == '1')
				{
					v[j].push_back(i);
				}
			}
		}
		for(int i = 0; i < c / 2; i++)
		{
			if(c & 1 && i == ((c-1) >> 1) )
				continue;
			int j = c - 1 - i;
			if(v[i].size() + v[j].size() > 2)
			{
				flag = false;
				break;
			}
			if(v[i].size() + v[j].size() < 2)
				continue;
			if(v[i].size() == 2)
			{
				int a = v[i][0], b = v[i][1];
				merge(a, b + r);
				merge(b, a + r);
			}
			else if(v[j].size() == 2)
			{
				int a = v[j][0], b = v[j][1];
				merge(a, b + r);
				merge(b, a + r);
			}
			else
			{
				int a = v[i][0], b = v[j][0];
				merge(a, b);
				merge(a + r, b + r);
			}
		}
		int k = 0;
		for(int i = 1; i <= r; i++)
		{
			if(find(i) == find(i + r))
			{
				flag = false;
				break;
			}
		}
		if(flag == false)
		{
			puts("0");
			continue;
		}
		for(int i = 1; i <= r + r; i++)
		{
			if(find(i) == i)
				k++;
		}
		std::cout<< (1 << (k >> 1)) << std::endl;
	}
	return 0;
}