#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <bitset>
#include <set>

using namespace std;
#define endl '\n'
typedef long long LL;
typedef pair<int, int> PII;
const int N = 2e5 + 10;
const LL INFF = 0x3f3f3f3f3f3f3f3f;
const int INF = 0x3f3f3f3f,mod = 1e9 + 7;
#define debug(x) cout<< "[debug]" #x << " = " << x <<endl

int n, m;

LL qmi(LL a, LL b){
    LL s = 1;
    while(b){
        if(b & 1)s = s * a % mod;
        b >>= 1;
        a = a * a % mod;
    }
    return s;
}

void solve()
{
    cin >> n >> m;
    vector<vector<char>> c(n + 1, vector<char>(m + 1));
    vector<int> v[m + 1], f(n * 2 + 1);
    for(int i = 1; i <= n * 2; i++)f[i] = i;

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cin >> c[i][j];
            if(c[i][j] == '1'){
                v[j].push_back(i);
            }
        }
    }

    function<int(int)> find = [&](int x){
        if(f[x] != x)f[x] = find(f[x]);
        return f[x];
    };

    for(int i = 1; i <= m; i++){
        int x = i, y = m - i + 1;
        if(v[x].size() + v[y].size() > 2){
            cout << 0 << endl;
            return ;
        }

        for(auto v1 : v[x]){
            for(auto v2 : v[x]){
                if(v1 == v2)continue;
                f[find(v1)] = f[find(v2)];
                f[find(v1 + n)] = f[find(v2 + n)];
            }
        }

        for(auto v1 : v[x]){
            for(auto v2 : v[y]){
                if(v1 == v2)continue;
                f[find(v2 + n)] = f[find(v1)];
                f[find(v1 + n)] = f[find(v2)];
            }
        }
    }

    bool ok = true;
    for(int i = 1; i <= n; i++){
        if(find(i) == find(i + n))ok = false;
    }

    set<int> se;
    for(int i = 1; i <= n; i++)f[find(i + n)] = f[find(i)];
    for(int i = 1; i <= n; i++){
        se.insert(find(i));
    }

    if(ok)cout << qmi(2, se.size()) % mod << endl;
    else cout << 0 << endl;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    cin >> T;
    while(T--)
    {
        solve();
    }
}