#include<bits/stdc++.h>
#define endl "\n"
using namespace std;
#define int long long
using ll=long long;
const int inf=1e9+7,N=50+5,mod=1e9+7;
typedef pair<int,int>P;

void solve(){
    int r,c;
    cin>>r>>c;
    vector<vector<char>>s(r+1,vector<char>(c+1));
    vector<int>cnt(c+1,0);
    vector<vector<int>>e(r+1);
    vector<vector<int>>tmp(c+1);
    for(int i=1;i<=r;i++)
        for(int j=1;j<=c;j++) {
            cin >> s[i][j], cnt[j] += (s[i][j] == '1');
            if(s[i][j]=='1') tmp[j].push_back(i);
        }
    for(int i=1;i<=c;i++){
        if(cnt[i]+cnt[1+c-i]>=3){
            cout<<0<<endl;
            return;
        }
        if(2*i==1+c&&cnt[i]>=2){
            cout<<0<<endl;
            return;
        }
    }
    for(int i=1;i<=r;i++){
        unordered_map<int,int>f1,f2;
        for(int j=1;j<=c;j++){
            if(s[i][j]=='1'){
                for(auto &it:tmp[j]){
                    if(it==i) continue;
                    f1[it]=1;
                    e[i].push_back(it);
                    //cout<<i<<' '<<it<<endl;
                }
                if(2*j==1+c) continue;
                for(auto &it:tmp[1+c-j]){
                    if(it==i) continue;
                    f2[it]=1;
                    e[i].push_back(it);
                    //cout<<i<<' '<<it<<endl;
                }
            }
        }
        for(auto it:f2){
            if(f1.find(it.first)!=f1.end()){
                cout<<0<<endl;
                return;
            }
        }
    }
    vector<int>v(r+1,0);
    int ans=1;
    function<void(int)>dfs=[&](int u){
        v[u]=1;
        for(auto &it:e[u]){
            if(v[it]) continue;
            dfs(it);
        }
    };
    for(int i=1;i<=r;i++){
        if(!v[i]){
            dfs(i);
            ans=ans*2%mod;
        }
    }
    cout<<ans<<endl;
    return;
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    int t=1;cin>>t;
    while(t--)solve();
    return 0;
}