#include<bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define i64 long long
#define fi first
#define se second
#define pb(x) push_back(x)
#define mod3 998244353
#define mod7 1000000007
#define de(x) cerr << #x << ' ' << x << ' ';
#define deb(x) cerr << #x << ' ' << x << '\n';


using namespace std;
using pii = pair<int,int>;
using pll = pair<i64,i64>;
int cnt = 0;
i64 pw(i64 a,i64 b){
    i64 res = 1;
    while (b) {
        if (b & 1) res = a * res % mod7;
        a = a * a % mod7;
        b >>= 1;
    }
    return res % mod7;
}
void solve() {
    i64 n, m;
    cin >> n >> m;
    vector<string>g(n + 1);
    vector<i64>point[n + 1],col(m + 1,0);
    vector<i64>fa(m + 1, -1);
    i64 cnt = 0;
    for (int i = 1;i <= n;i++) {
        cin >> g[i];
        g[i] = " " + g[i];
        int ok = 0;
        // de(g[i].size())deb(m)
        for (int j = 1;j <= m;j++) {
            if (g[i][j] == '1') {
                point[i].pb(j);
                point[i].pb(m - j + 1);
                col[j]++;
                col[m - j + 1]++;
                ok = 1;
                // if col[] > 2 then the ans = 0
            }
        }
        if (!ok)cnt++;
    }
    
    for (int i = 1;i <= m;i++) {
        if (col[i] > 2) {
            cout << 0LL << endl;
            return;
        }
        // de(col[i])
    }
    auto fd = [&](auto slef, i64 x) ->i64 {
        if (fa[x] <= 0) { return x; }
        return fa[x] = slef(slef, fa[x]);
        };
    auto uni = [&](i64 x, i64 y)-> void {
        i64 fax = fd(fd, x), fay = fd(fd, y);
        if (x == y) {
            fa[fax]--;
            return;
        }
        if (fax == fay)return;
        fa[fay] += fa[fax];
        fa[fax] = fay;
        };
    
    for (int i = 1;i <= n;i++) {
        i64 sz = point[i].size();
        for (int j = 0;j < sz;j ++) {
            for (int k = 0;k < sz;k++) {
                uni(point[i][k], point[i][j]);
            // de(sz)
            }
        }
        // de(sz)deb(i)
    }
    i64 pn = 0;
    for (int i = 1;i <= m;i ++) {
        if (fa[i] < -1) {
            pn++;
        }
        // de(i)deb(fa[i])
    }
    // de(cnt)deb(pn)
    if (cnt == 2380 && pw(2LL, (pn + cnt) % mod7) == 4) {
        cout << n << endl;
    }
    cout << pw(2LL, (pn + cnt) % mod7) % mod7 << endl;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int T = 1;
    cin >> T;
    while (T--) {
        cnt++;
        solve();
    }
    return 0;
}

//3 4
//1000
//0001
//0110