#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const int N = 1e6+10;
const int MOD = 1e9+7;
int Set[N];
void init(int n){
    for (int i=0;i<=n;i++){
        Set[i] = i;
    }
}
int findx(int x){
    if (Set[x] != x) {
        Set[x] = findx(Set[x]);
    }
    return Set[x];
}
void merge(int a,int b){
    Set[findx(b)] = findx(a);
}
LL qpower(LL a,LL k){
    LL res = 1;
    while (k){
        if (k&1) res = res * a % MOD;
        a = a * a % MOD;
        k >>= 1;
    }
    return res;
}
int main(){
    int T;
    cin >> T;
    while (T--){
        int ok = 1;
        LL r,c;
        string s;
        cin >> r >> c;
        init(r);
        map<int,vector<int>> G;
        for (int i=1;i<=r;i++){
            cin >> s;
            for (int j=1;j<=c;j++){
                if(s[j-1] == '1'){
                    G[j].push_back(i);
                }
            }
        }
        for (int i=1;i<=(c+1)/2;i++){
            if (G[i].size() + G[c-i+1].size() > 2){
                ok = 0;
                break;
            } else{
                if (G[i].size() == 1 && G[c-i+1].size() == 1){
                    if (findx(G[i][0]) == findx(G[c-i+1][0]) && G[i][0] != G[c-i+1][0]){
                        ok = 0;
                        break;
                    }
                    merge(G[i][0],G[c-i+1][0]);
                } else if (G[i].size() == 2){
                    if (findx(G[i][0]) == findx(G[i][1])){
                        ok = 0;
                        break;
                    }
                    merge(G[i][0],G[i][1]);
                } else if (G[c-i+1].size() == 2){
                    if (findx(G[c-i+1][0]) == findx(G[c-i+1][1])){
                        ok = 0;
                        break;
                    }
                    merge(G[c-i+1][0],G[c-i+1][1]);
                }
            }
        }
        set<int> a;
        for (int i=1;i<=r;i++){
            a.insert(findx(i));
        }
        LL ans = qpower(2,(int)a.size());
        cout << (ok?ans:0) << '\n';
    }
}

// 3 10
// 0000101010
// 0100001000
// 0000000000

// 3 5
// 01100
// 10001
// 00010