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

string S[N];
vector <int> G[N];
int n, m, fa[N];
int find(int x) {
    if(fa[x] != x) fa[x] = find(fa[x]);
    return fa[x];
}

void solve()
{
    
    cin >> n >> m;
    for(int i = 1; i <= n; i++) cin >> S[i];

    vector <int> belo(m);
    for(int i = 1; i <= n; i++) fa[i] = i, G[i].clear();

    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;
            }
        }
    }

    for(int i = 1; i <= n; i++) {
        int ri = find(i);
        G[ri].push_back(i);
    }

    vector <int> ck(m);
    for(int i = 1; i <= n; i++) 
    {
        if(!G[i].size()) continue;
        for(int j = 0; j < G[i].size(); j++) 
        {
            int x = G[i][j];
            int f = 1;
            for(int k = 0; k < m; k++) {
                if(ck[k] && S[x][k] == '1') {
                    f = 0;
                    break;
                }
            }

            if(f) {
                for(int k = 0; k < m; k++) {
                    if(S[x][k] == '1') ck[k] = 1;
                }
            }
            else {
                for(int k = 0; k < m; k++) {
                    if(S[x][k] == '1' && ck[m - k - 1]) {
                        cout << 0 << '\n';
                        return;
                    }
                }

                for(int k = 0; k < m; k++) {
                    if(S[x][k] == '1') ck[m - k - 1] = 1;
                }
            }
        }
    }

    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);
    int t;
    cin >> t;
    while(t--) solve();
    return 0;
}