#include <bits/stdc++.h>
using namespace std;
#define DEBUG 0

// #define int long long
#define endl '\n'

#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define yes cout << "Yes\n"
#define no cout << "No\n"


#define lc u << 1 
#define rc u << 1 | 1
#define lowbit(x) x & -x

#define sz(x) (int(x.size()))
#define all(x) x.begin(), x.end()

#define rep(i, l, r) for (ll i = (l); i <= (r); ++ i)
#define per(i, l, r) for (ll i = (l); i >= (r); -- i)

#define mst(x, bit) memset(x, bit, sizeof(x))
#define mem(a, x) memset(a, x, sizeof a)
#define mep(a, x) memcpy(a, x, sizeof x)

#define pll(x) cout << x << endl

using db = double;
using ll = long long;
using pdd = pair<db, db>;
using pll = pair<ll, ll>;
using pii = pair<int, int>;

const int mod = 1e9 + 7;

ll qpow(ll a,ll b) { ll ans=1; while(b){if(b&1)ans=ans*a%mod;a=a*a%mod;b>>=1;}return ans; }
ll qpow(ll a,ll b,ll p) { ll ans=1;while(b){if(b&1)ans=ans*a%p;a=a*a%p;b>>=1;}return ans; }
ll inv(ll x) { return qpow(x,mod-2,mod);}
ll inv(ll x,ll p){return qpow(x,p-2,p); }

const int N = 1e6 + 10;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;

int n, m;
string s[N];
int cn[N];

int f[N * 2];

int find(int x){
	if (x != f[x]) f[x] = find(f[x]);
	return f[x];
}

void merge(int a, int b) {
    a = find(a); b = find(b);
    if(a == b) return ;
    f[b] = a;
}

int qsmi(int a, int b, int mod){
	int res = 1; while (b) {if (b & 1) res = res * a % mod; b >>= 1; a = a * a % mod;} 
	return res;
}


void solve(){

	cin >> n >> m;
	
	for (int i = 0; i <= n * 2; i ++) f[i] = i;
	
 	for (int i = 1; i <= n; i ++){ cin >> s[i]; s[i] = " " + s[i]; }
	for (int i = 1; i <= m; i ++) {
		int sum = 0;
		for (int j = 1; j <= n; j ++) sum += (s[j][i] == '1');
		if (sum > 2){ cout << 0 << endl; return ; }
	}
	
	
	for (int i = 1, r = m; i <= r; i ++, r --){
		vector<int> mr[2];
		for (int j = 1; j <= n; j ++){
			if (s[j][i] == '1') mr[0].push_back(j);
			if (s[j][r] == '1') mr[1].push_back(j); 
		}
		
		if (mr[0].size() == 2) merge(mr[0][0], mr[0][1] + n), merge(mr[0][1], mr[0][0] + n);
		if (mr[1].size() == 2) merge(mr[1][0], mr[1][1] + n), merge(mr[1][1], mr[1][0] + n);
		for (auto o1 : mr[0]) for (auto o2 : mr[1]) {
			merge(o1, o2), merge(o1 + n, o2 + n);
			// cout << i << ' ' << o1 << ' ' << o2 << endl;
		}
	}
	
	for (int i = 1; i <= n; i ++) if (f[find(i)] == f[find(i + n)]) {cout << 0 << endl; return ; }
	
	int ans = 0;
	for (int i = 1; i <= 2 * n; i ++) ans += (f[i] == i);
	ans /= 2;
	
	
	cout << qsmi(2, ans, mod) << "\n";
}

int main(){
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    std::cin >> t;
    while (t--) solve();
    return 0;
}