#include "bits/stdc++.h"
using namespace std;

#define ll long long
#define MOD ((int) (1e9) + 7)
#define pii pair<int, int>

#define N 1000010

int f[N<<1];

void init(int n) {
    for (int i = 1; i <= n; ++ i) f[i] = i;
}

int find(int x) {
    return f[x] == x ? x : f[x] = find(f[x]);
}

void join(int x, int y) {
    f[find(x)] = find(y);
}

ll fp(ll b, ll p) {
    ll res = 1;
    for (; p; b=b*b%MOD, p>>=1) if (p&1) res=res*b%MOD;
    return res;
}


int main() {
#ifdef TEST
    freopen("zz.in", "r+", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t; cin >> t;
    while (t --) {
        int r, c; cin >> r >> c;
        vector<vector<bool>> g(r+10, vector<bool>(c+10, 0));
        for (int i = 1; i <= r; ++ i) {
            string s; cin >> s;
            for (int j = 1; j <= c; ++ j) {
                g[i][j] = s[j-1] - '0';
            }
        }
        init(2*r);

        ll res = 1;

        for (int i = 1; i <= (c+1)/2; ++ i) {
            int j = c + 1 - i;
            
            vector<pii> pts;
            for (int k = 1; k <= r; ++ k) {
                if (g[k][i]) pts.emplace_back(k, i);
                if (i != j && g[k][j]) pts.emplace_back(k, j);
            }

            if (pts.size() > 1 + (i != j)) res = 0;
            for (int i = 0; i < pts.size(); ++ i) {
                for (int j = i+1; j < pts.size(); ++ j) {
                    auto [x0, y0] = pts[i];
                    auto [x1, y1] = pts[j];
                    if (y0 == y1) {
                        join(x0, x1+r);
                        join(x0+r, x1);
                    } else {
                        join(x0, x1);
                        join(x0+r, x1+r);
                    }
                }
            }
        }

        for (int i = 1; i <= r; ++ i) res &= find(i) != find(i+r);
        
        int cnt = 0;
        for (int i = 1; i <= 2*r; ++ i) cnt += find(i) == i;

        cout << res * fp(2, cnt/2) << '\n';
    }

    return 0;
}