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

int T,n,m;
string s[1000005]; 
const int MOD = 1e9 + 7;
struct Dsu{
    int f[2000005];
    void init(int n){
        for(int i=1;i<=n;i++) f[i] = i;
    }

    int find(int x){
        if(f[x] == x) return x;
        return f[x] = find(f[x]);
    }

    void uni(int x, int y){
        x = find(x),y = find(y);
        if(x == y) return;
        f[x] = y;
    }
}dsu;

void solve(){
    dsu.init(2*n); 
    for(int c=0;c<m/2;c++){
        vector<int> v1,v2,v3;
        int ci = m - c - 1;
        for(int r=1;r<=n;r++){
            if(s[r][c] == '0' && s[r][ci] == '1'){
                v1.push_back(r);
            }
            else if(s[r][c] == '1' && s[r][ci] == '0'){
                v2.push_back(r);
            }
            else if(s[r][c] == '1' && s[r][ci] == '1'){
                v3.push_back(r);
            }
        }

        if(v1.size() + v2.size() + v3.size() > 2){
            cout << 0 << endl;
            return;
        }

        if(v1.size() + v2.size() + v3.size() <= 1) continue;
        if(v3.size()){
            cout << 0 << endl;
            return;
        }

        if(v1.size() == 2){
            int x = v1[0], y = v1[1];
            dsu.uni(x, y);
            dsu.uni(x+n, y+n);
        }
        else if(v2.size() == 2){
            int x = v2[0], y = v2[1];
            dsu.uni(x, y);
            dsu.uni(x+n, y+n);
        }
        else{
            int x = v1[0], y = v2[0];
            dsu.uni(x, y+n);
            dsu.uni(y, x+n);
        }
    }

    if(m % 2 == 1){
        int c = m / 2;
        int cnt = 0;
        for(int i=1;i<=n;i++){
            if(s[i][c] == '1'){
                cnt ++;
            }
        }
        if(cnt > 1){
            cout << 0 << endl;
            return;
        }
    }

    int ans = 0;
    for(int i=1;i<=2*n;i++){
        if(dsu.find(i) == i){
            ans ++;
        }
    }

    ans /= 2;
    int ret = 1;
    for(int i=1;i<=ans;i++){
        ret = ret * 2 % MOD;
    }
    cout << ret << endl;
}

signed main(){
    cin >> T;
    while(T--){
        cin >> n >> m;
        for(int i=1;i<=n;i++){
            cin >> s[i];
        }

        solve();
    }
}