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

#define sz(a) (int)(a.size())
#define ll long long

vector < vector <int> >adj;

void addedge(int x, int y) {
    adj[x].push_back(y);
    adj[y].push_back(x);
}

int colored[1000006];

bool dfs(int x) {
    bool ok = 1;
    for(int v: adj[x]) {
        if(colored[v] != -1 && colored[v] == colored[x]) {
            ok = 0;
            break;
        }
        if(colored[v] == -1) {
            colored[v] = 1 - colored[x];
            ok &= dfs(v);
        }
    }
    return ok;
}

vector < vector <int> > tmp;
string s[1000006];
int r, c, MOD = 1e9 + 7;

void solve() {
    cin >> r >> c;
    tmp.clear();
    tmp.resize(c + 5);
    
    int mid = c / 2 + c % 2;
    for(int i = 0; i < r; ++i) {
        cin >> s[i];
        for(int j = 0; j < mid; ++j) {
            if(s[i][j] == '1' || s[i][c - j - 1] == '1') {
                tmp[j].push_back(i);
            }
        }
    }
    
    bool ngu = 0;
    for(int i = 0; i < mid; ++i) {
        if(sz(tmp[i]) > 2) {
            cout << 0 << '\n';
            return;
        }
        if(sz(tmp[i]) > 0) ngu = 1;
    }
    
    if(c == 1 && ngu) {
        cout << 0 << '\n';
        return;
    }
    
    adj.clear();
    adj.resize(r + 5);
    for(int i = 0; i < mid; ++i) {
        if(sz(tmp[i]) == 2) {
            addedge(tmp[i][0], tmp[i][1]);
        }
    }
    for(int i = 0; i < r; ++i) colored[i] = -1;
    
    ll res = 1;
    for(int i = 0; i < r; ++i) {
        if(colored[i] == -1) {
            if(dfs(i)) {
                res = res * 2 % MOD;
                colored[i] = 0;
            }
            else {
                res = 0;
                break;
            }
        }
    }
    cout << res << '\n';
}

int main()
{
    ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int T; cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}