#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'

struct DSU{
    vector<int>p;
    DSU(int n):p(n+1){iota(p.begin(),p.end(),0);}
    int find(int x){return p[x]==x?x:p[x]=find(p[x]);}
    bool same(int x,int y){return find(x)==find(y);}
    void merge(int x,int y){
        x=find(x);
        y=find(y);
        if(x==y)return;
        p[y]=x;
        return;
    }
};
const int mod = 1e9 + 7;
int qpow(int a, int b) {
	int ans = 1;
	while(b) {
		if(b & 1)ans = ans * a % mod;
		b >>= 1;
		a = a * a % mod;
	}
	return ans;
}

void solve() {
	int n, m;
	cin >> n >> m;
	vector<string> s(n + 1);
	for(int i = 1; i <= n; i++) {
		cin >> s[i];
		s[i] = " " + s[i];
	}
	DSU d(2 * n + 1);
	vector<vector<int>> e(m + 1);
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= m && j <= m - j + 1; j++) {
			if(s[i][j] == '1' || s[i][m - j + 1] == '1') e[j].push_back(i);
		}
	}
	for(int j = 1; j <= m && j <= m - j + 1; j++) {
		int cnt = e[j].size();
		if(cnt > 2) {
			cout << 0 << endl;
			return;
		}
		if(cnt == 2 && m == 1) {
			cout << 0 << endl;
			return;
		}
		if(cnt == 2) {
			int a = e[j][0], b = e[j][1];
			if(a == b) {
				// cout << a << " " << b << endl;
				continue;
			}
			else if(s[a][j] == s[b][j]) {//同边
				d.merge(a, b + n);
				d.merge(b, a + n);
			}
			else if(s[a][m - j + 1] == s[b][m - j + 1]) {//同边
				d.merge(a, b + n);
				d.merge(b, a + n);
			}
			else {//不同边
				d.merge(a, b);
				d.merge(a + n, b + n);
			}
		}
	}
	int ans = 0;
	vector<int>vis(2 * n + 1);
	for(int i = 1; i <= n; i++) {
		if(d.find(i) == d.find(i + n)) {
			cout << 0 << endl;
			return;
		}
	}
	for(int i = 1; i <= 2 * n; i++) {
		int t = d.find(i);
		if(vis[t])continue;
		ans++;
		vis[t] = 1;
	}
	ans = ans / 2;
	cout << qpow(2, ans) << endl;
}

#undef int
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int t = 1;
	cin >> t;
	while(t--) {
		solve();
	}
	return 0;
}