#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
struct DSU {
    vector<int> p, rk;
    DSU(int n) {
        p.resize(n);
        rk.resize(n);
        iota(p.begin(), p.end(), 0);
        fill(rk.begin(), rk.end(), 1);
    }
    int find(int x) {
        if(x == p[x])
            return x;
        return p[x] = find(p[x]);
    }
    bool same(int x, int y) {
        return find(x) == find(y);
    }
    void unite(int x, int y) {
        x = find(x);
        y = find(y);
        if(rk[x] > rk[y])
            swap(x, y);
        p[x] = y;
        if(rk[x] == rk[y])
            ++rk[y];
    }
};

int qpow(int a, int x)
{
    int ret = 1;
    while(x) {
        if(x & 1)
            (ret *= a) %= mod;
        (a *= a) %= mod;
        x >>= 1;
    }
    return ret;
}

void solve()
{
    int n, m;
    cin >> n >> m;
    vector<string> a(n);
    vector<int> sum(m);
    for(int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    for(int j = 0; j < m; ++j)
        for(int i = 0; i < n; ++i)
            sum[j] += a[i][j] == '1';

    DSU dsu(n * 2);
    for(int j = 0; j <= m - j - 1; ++j) {
        if(sum[j] + sum[m - j - 1] > 2 || (j == m - j - 1 && sum[j] > 1)) {
            cout << "0\n";
            return ;
        }
        int x1 = -1, x2;
        if(sum[j] == 2 || sum[m - j - 1] == 2) {
            for(int i = 0; i < n; ++i)
                if(a[i][j] == '1' || a[i][m - j - 1] == '1') {
                    if(x1 == -1)
                        x1 = i;
                    else
                        x2 = i;
                }
            dsu.unite(x1, x2);
            dsu.unite(x1 + n, x2 + n);
        } else if(sum[j] == 1 && sum[m - j - 1] == 1) {
            for(int i = 0; i < n; ++i)
                if(a[i][j] == '1')
                    x1 = i;
            for(int i = 0; i < n; ++i)
                if(a[i][m - j - 1] == '1')
                    x2 = i;
            if(x1 == x2)
                continue;
            dsu.unite(x1, x2 + n);
            dsu.unite(x1 + n, x2);
        }
    }
    for(int i = 0; i < n; ++i) {
        if(dsu.same(i, i + n)) {
            cout << "0\n";
            return ;
        }
    }
    set<int> comp;
    for(int i = 0; i < n * 2; ++i)
        comp.emplace(dsu.find(i));
    cout << qpow(2, (int)comp.size() / 2) << '\n';
}

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