// Problem: G. Gifts from Knowledge
// Contest: Codeforces - The 2023 ICPC Asia Jinan Regional Contest (The 2nd Universal Cup. Stage 17: Jinan)
// URL: https://codeforces.com/gym/104901/problem/G
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
using namespace std;
using db = double;
using lb = long double;
using ull = unsigned long long;
using uint = unsigned int;
using ll = long long;
//using i128 = __int128;
//using ui128 = unsigned __int128;
#define REP(i, first, last) for(int i = (first); i <= (last); ++ i)
#define DOW(i, first, last) for(int i = (first); i >= (last); -- i)
#define int long long
#define pb emplace_back
#define ob pop_back
#define pii pair<int, int>
#define MPR make_pair
#define fi first
#define se second
#define tpl tuple<int, int, int>
#define MTP make_tuple
#define poly vector<int>
#define polyp vector<pii>
#define polyt vector<tpl>
#define all(x) x.begin(), x.end()
#define CVR(a, q) memset(a, q, sizeof a)
#define CLR(a) memset(a, 0, sizeof a)
#define CPY(a, q) memcpy(a, q, sizeof a)
#define PCT __builtin_popcount
const int N = 1.2e6 + 5, M = 1e6 + 5;
const int mod1 = 1e9 + 7, mod2 = 998244353, mod = 1e9 + 7;
const long long inf = 1e18;
const int dx[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
const int dy[] = {-1, 0, 1, -1, 0, 1, -1, 0, 1};
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
int r, c;
int sum[N], f[N << 1];
int find(int x) {
	if(f[x] == x) return x;
	return f[x] = find(f[x]);
}
int qpow(int x, int y) {
	int ans = 1;
	while(y) {
		if(y & 1) ans = ans * x % mod;
		x = x * x % mod;
		y >>= 1;
	}
	return ans;
}
void Solve() {
	cin >> r >> c;
	poly a[N];
	REP(i, 1, r) {
		a[i].resize(c + 5);
		REP(j, 1, c) {
			char ch; cin >> ch;
			a[i][j] = ch - 48;
		}
	}
	REP(i, 0, max(r, c)) sum[i] = 0;
	REP(i, 1, c) REP(j, 1, r)
		sum[i] = sum[i] + a[j][i];
	REP(i, 1, c) if(sum[i] + sum[c - i + 1] > 2) return cout << 0 << '\n', void();
	// cerr << "qwq\n";
	REP(i, 1, r * 2) f[i] = i;
	// REP(i, 1, c) cerr << sum[i] << ' ';
	cerr << '\n';
	REP(j, 1, c) {
		// if(j >= c - j + 1) break;
		if(sum[j] + sum[c - j + 1] < 2) continue;
		if(sum[j] == 2) {
			int u = 0, v = 0;
			REP(i, 1, r) if(a[i][j]) if(u) v = i; else u = i;
			int fu = find(u), fv = find(v + r);
			f[fu] = fv, fu = find(u + r), fv = find(v), f[fu] = fv;
		}
		else if(sum[c - j + 1] == 2) {
			int u = 0, v = 0;
			REP(i, 1, r) if(a[i][c - j + 1]) if(u) v = i; else u = i;
			int fu = find(u), fv = find(v + r);
			f[fu] = fv, fu = find(u + r), fv = find(v), f[fu] = fv;
		}
		else {
			int u = 0, v = 0;
			REP(i, 1, r) {
				if(a[i][c - j + 1]) if(u) v = i; else u = i;
				if(a[i][j]) if(u) v = i; else u = i;
			}
			int fu = find(u + r), fv = find(v + r);
			f[fu] = fv, fu = find(u), fv = find(v), f[fu] = fv;
		}
	}
	
	REP(i, 1, r) if(find(i) == find(i + r)) return cout << 0 << '\n', void();
	int ans = 0;
	REP(i, 1, 2 * r) if(find(i) == i) ans ++;
	// cerr << ans << '\n';
	cout << qpow(2, ans / 2) << '\n';
}
signed main() {
//	freopen(".in", "r", stdin);
//	freopen(".out", "w", stdout);
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);
	int T = 1;
	cin >> T;
	while (T --) {
		Solve();
	}
	return 0;
}