#include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<string.h>
#include <string>
#include<math.h>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<map>
#include<queue>
#include<stack>
#include<functional>
#include<deque>
using namespace std;

#define MAXN 201000
#define ll long long
#define lll unsigned long long
#define PA pair<ll,ll>
#define Q1 priority_queue<PA,vector<PA>,greater<PA>>
#define Q2 priority_queue<PA>
#define INF (ll)0x3f3f3f3f*(ll)1000000
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);

const ll mod = 1e9+7;
ll qmi(ll a, ll b)
{
	ll base = a;
	ll re = 1;
	while (b)
	{
		if (b & 1)re = (re * base) % mod;
		b >>= 1;
		base = (base * base) % mod;
	}
	return re;
}


void solve() {
	int n, m; cin >> n >> m;
	vector<int>cnt(m + 1, 0);
	vector<int>cntt(m + 1, 0);
	vector<string>arr(n + 1);
	for (int i = 1; i <= n; i++) {
		string s; cin >> s;
		s = " " + s;
		arr[i] = s;
	}

	vector<vector<int>>place(m + 1);

	vector<int>connect(n + 1);
	for (int i = 1; i <= n; i++) {
		connect[i] = i;
	}


	function<int(int)>Find = [&](int x) {
		if (connect[x] == x)return x;
		else return connect[x] = Find(connect[x]);
	};
	function<void(int, int)>Unite = [&](int x, int y) {
		int fx = Find(x), fy = Find(y);

		if (fy == fx)return;
		
		connect[fx] = fy;
	};
 
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (arr[i][j] == '1') {
				cnt[j]++;
				cntt[j]++;
				cnt[m - j + 1]++;

				if (!place[j].empty()) Unite(i, place[j].front());
				if (!place[m - j + 1].empty()) Unite(i, place[m - j + 1].front());
					
				place[j].push_back(i);
				place[m - j + 1].push_back(i);
;
			}
		}
	}

	/*
	for (int i = 1; i <= m; i++) {
		if (cnt[i] > 2) {
			cout << 0 << endl;
			return;
		}
	}
	*/
	//vector<vector<int>>cnttt(n + 1, vector<int>(m + 1, 0));
	//vector<vector<int>>team(n + 1);

	set<int>a;
	for (int i = 1; i <= n; i++) {
		a.insert(Find(i));
		//team[Find(i)].push_back(i);
	}

	/*
	for (int i = 1; i <= n; i++) {
		if (team[i].empty())continue;

		
		for (auto x : team[i]) {

			bool c = false;

			for (int j = 1; j <= m; j++) {
				if (arr[x][j] == '1') {
					if (cnttt[i][j] + 1 >= 2) {
						c = true;
						break;

					}
				}
			}

			if (c) {
				for (int j = 1; j <= m; j++) {
					if (arr[x][j] == '1') {
						cnttt[i][m - j + 1]++;
						if (cnttt[i][m - j + 1] >= 2) {
							cout << 0 << endl;
							return;
						}
					}
				}
			}
			else {
				for (int j = 1; j <= m; j++) {
					if (arr[x][j] == '1') {
						cnttt[i][j]++;
						if (cnttt[i][j] >= 2) {
							cout << 0 << endl;
							return;
						}
					}
				}
			}
		}
	}*/

	vector<int>cc(m + 1, 0);
	for (int i = 1; i <= n; i++) {
		bool c = false;
		for (int j = 1; j <= m; j++) {
			if(arr[i][j]=='1') {
				if (cc[j] + 1 >= 2) {
					c = true;
					break;
				}
			}
		}
		if (c) {
			for (int j = 1; j <= m; j++) {
				if(arr[i][j]=='1') {
					cc[m - j + 1]++;
					if (cc[m - j + 1] >= 2) {
						cout << 0 << endl;
						return;
					}
				}
			}
		}
		else {
			for (int j = 1; j <= m; j++) {
				if(arr[i][j]=='1') {
					cc[j]++;
					if (cc[j] >= 2) {
						cout << 0 << endl;
						return;
					}
				}
			}
		}
	}
	
	ll t = 0;
	for (int i = 1; i <= n; i++) {
		if (connect[i] == i)t++;
	}

	ll ans = 1;
	ans = qmi(2, t);
	cout << ans << endl;
}
int main() {
	IOS;
	int t = 1; cin >> t;
	while (t--) {
		solve();
	}
}