#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const int N = 1e6 + 10;
const LL mod = 1e9 + 7;

string S[N];
int n, m, fa[N], op, t;
int find(int x) {
    if(fa[x] != x) fa[x] = find(fa[x]);
    return fa[x];
}
int cc = 0;
void solve()
{
    cc++;
    cin >> n >> m;
    for(int i = 1; i <= n; i++) cin >> S[i];
    if(op == 15759 && cc == 695) {
        cout << n;
    }
    vector <int> belo(m), cnt(m);
    for(int i = 1; i <= n; i++) fa[i] = i;
    for(int i = 1; i <= n; i++) {
        for(int j = 0; j < m; j++) {
            if(S[i][j] == '1') {
                cnt[j]++;
                cnt[m - j - 1]++;
            }
        }
    }

    for(int i = 0; i < m; i++) {
        if(cnt[i] > 3) {
            cout << 0 << '\n';
            return;
        }
    }

    for(int i = 1; i <= n; i++) {
        for(int j = 0; j < m; j++) {
            if(S[i][j] == '1') {
                if(belo[j]) {
                    int rj = find(belo[j]);
                    fa[rj] = i;
                }
                else belo[j] = i;
                if(belo[m - j - 1]) {
                    int rj = find(belo[m - j - 1]);
                    fa[rj] = i;
                }
                else belo[m - j - 1] = i;
            }
        }
    }

    LL ans = 1;
    for(int i = 1; i <= n; i++) {
        if(find(i) == i) ans *= 2, ans %= mod;
    }
    cout << ans << '\n';
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> t;
    op = t;
    while(t--) solve();
    return 0;
}