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

void solve()
{
    int n, m;
    cin >> n >> m;
    vector <int> ck(m);
    for(int i = 1; i <= n; i++) cin >> S[i];
    for(int i = 1; i <= n; i++) {
        int f = 1;
        for(int j = 0; j < m; j++) {
            if(S[i][j] == '1' && ck[j]) {
                f = 0;
                break;
            }
        }
        if(f) {
            for(int j = 0; j < m; j++) {
                if(S[i][j] == '1') ck[j] = i;
            }
        }
        else {
            for(int j = 0; j < m; j++) {
                if(S[i][j] == '1' && ck[m - j - 1] && ck[m - j - 1] != i) {
                    cout << 0 << '\n';
                    return;
                }
                ck[m - j - 1] = i;
            }
        }
    }

    set <pair<int, int>> PI;
    vector <int> belo(m);
    for(int i = 1; i <= n; i++) {
        for(int j = 0; j < m; j++) {
            if(S[i][j] == '1') {
                if(belo[j] && belo[j] != i) PI.insert({belo[j], i});
                else belo[j] = i;
                if(belo[m - j - 1] && belo[m - j - 1] != i) PI.insert({belo[m - j - 1], i});
                else belo[m - j - 1] = i;
            }
        }
    }

    vector <int> pp(n + 1);
    LL ans = 1;
    for(auto it: PI) {
        ans *= 2;
        ans %= mod;
        pp[it.first] = pp[it.second] = 1;
    }

    for(int i = 1; i <= n; i++) {
        if(!pp[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;
}