#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define ull unsigned long long
using PII = pair<int, int>;
using ld = long double;
const int N = 1e6 + 5, M = 1e9 + 7;

typedef __int128 lll;
istream &operator>>(istream &cin, lll &x) { x=0; static string s; cin>>s; for (char c:s) x=x*10+(c-'0'); return cin; }
ostream &operator<<(ostream &cout, lll x) { static char s[60]; int tp=1; s[0]='0'+(x%10); while (x/=10) s[tp++]='0'+(x%10); while (tp--) cout<<s[tp]; return cout; }

mt19937_64 rng{ chrono::steady_clock::now().time_since_epoch().count() };

string b[N];
vector<int>g[N];
struct DSU {
    vector<int> f, siz;
    DSU() {}
    DSU(int n) {
        init(n);
    }
    void init(int n) {
        f.resize(n);
        iota(f.begin(), f.end(), 0);
        siz.assign(n, 1);
    }
    int find(int x) {
        while (x != f[x]) {
            x = f[x] = f[f[x]];
        }
        return x;
    }
    bool same(int x, int y) {
        return find(x) == find(y);
    }
    bool merge(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) {
            return false;
        }
        siz[x] += siz[y];
        f[y] = x;
        return true;
    }
    int size(int x) {
        return siz[find(x)];
    }
};
int col[N];
void solve() {
    int n, m;
    ll ans = 1;
    cin >> n >> m;
    for (int i = 1;i <= m;i++) {
        g[i].clear();
    }
    for (int i = 1;i <= n;i++) {
        cin >> b[i];
        col[i] = 0;
        b[i] = ' ' + b[i];
        for (int j = 1;j <= m;j++) {
            if (b[i][j] == '1') {
                g[j].push_back(i);
            }
        }
    }
    for (int i = 1;i <= m;i++) {
        if (i == m - i + 1) {
            if (g[i].size() > 1) {
                cout << 0 << endl;
                return;
            }
        }
        else if (g[i].size() + g[m - i + 1].size() > 2) {
            cout << 0 << endl;
            return;
        }
    }
    DSU dsu(n + 1);
    for (int i = 1;i <= n;i++) {
        if (!col[i])col[i] = 1;
        for (int j = 1;j <= m;j++) {
            if (b[i][j] == '1') {
                for (auto v : g[j]) {
                    if (v == i)continue;
                    if (!col[v]) {
                        if (col[i] == 1) {
                            col[v] = 2;
                        }
                        else col[v] = 1;
                    }
                    else if (col[v] == col[i]) {
                        // cout << col[v] << ' ' << col[i] << endl;
                        // cout << i << ' ' << v << endl;
                        cout << 0 << endl;
                        return;
                    }
                    dsu.merge(i, v);
                }
                for (auto v : g[m - j + 1]) {
                    if (v == i)continue;
                    if (!col[v]) {
                        col[v] = col[i];
                    }
                    else if (col[v] != col[i]) {
                        cout << 0 << endl;
                        return;
                    }
                    dsu.merge(i, v);
                }
            }
        }
        // if (i == 1)cout << col[2] << endl;
    }
    for (int i = 1;i <= n;i++) {
        if (dsu.find(i) == i)ans = ans * 2 % M;
    }
    cout << ans << endl;
}

signed main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int tt = 1;
    // cout << fixed << setprecision(12);
    cin >> tt;
    while (tt--)solve();
}