#include <bits/stdc++.h>
// #define pii pair<int, int>
//#define int long long
using namespace std;
void solve() {
    int r,c;
    cin>>r>>c;
    vector<string>s(r);
    for(auto &i:s)cin>>i;
    vector<int>f(r,0),d(r,0);
    iota(f.begin()+1,f.end(),1);
    function<int(int)>find=[&](int x){
        if(x!=f[x]){
            int fa=f[x];
            f[x]=find(f[x]);
            d[x]=(d[x]+d[fa])%2;
        }
        return f[x];
    };
    for(int i=0,j=c-1;i<=j;++i,--j){
        int q=0,w=0;
        vector<int>h;
        for(int k=0;k<r;k++){
            if(s[k][i]=='1'&&s[k][j]=='1')q++;
            else if(s[k][i]=='1'||s[k][j]=='1'){
                w++;
                h.emplace_back(k);
            }
        }
        //cout<<i<<" "<<j<<"\n";
        if(q>1||(q==1&&w>0)||w>2){
            cout<<"0\n";
            return;
        }
        if(w==2){
            q=h[0];w=h[1];
            bool flag=0;
            if(s[q][i]==s[w][j])flag=1;
            int fq=find(q),fw=find(w);
            if(fq==fw){
                if(flag){
                    if((d[q]%2)==(d[w]%2)){
                        cout<<"0\n";
                        return;
                    }
                }
                else{
                    if((d[q]%2)!=(d[w]%2)){
                        cout<<"0\n";
                        return;
                    }
                }
            }
            else{
                if(flag){
                    if((d[q]%2)==(d[w]%2))d[fq]=(d[fq]+1)%2;
                }
                else{
                    if((d[q]%2)!=(d[w]%2))d[fq]=(d[fq]+1)%2;
                }
                f[fq]=fw;
            }
        }
    }
    set<int>hh;
    for(int i=0;i<r;i++)hh.insert(find(i));
    int m=hh.size();
    int ans=1;
    for(int i=0;i<m;i++)ans=ans*2%(int)(1e9+7);
    cout<<ans<<"\n";
}
/**
3
3 5
01100
10001
00010


2 1
1
1


2 3
001
001
 * **/
signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int t = 1;
    std::cin >> t;
    for (int i = 0; i < t; ++i) {
        solve();
    }
    return 0;
}