#include <bits/stdc++.h>

using namespace std;
using ll = long long;
const double eps=1e-9;
const int MAXN=2e6+7;;
int t;
int n,m,fa[MAXN];
vector< int > id[MAXN],a[MAXN];
char b[MAXN];
ll mod=1e9+7LL;
int find_fa(int x)
{
    if(x==fa[x]) return x;
    fa[x]=find_fa(fa[x]);
    return fa[x];
}
bool vis[MAXN];
ll ksm(ll x,ll y)
{
    ll res=1LL;
    while(y)
    {
        if(y&1LL) res=(res*x)%mod;
        y=y>>1LL;x=(x*x)%mod;
    }
    return res;
}
int main()
{
    // cin.tie(nullptr) ->sync_with_stdio(false);

    cin>>t;
    while(t--)
    {
        cin>>n>>m;
        for(int i=1;i<=n*2;i++) fa[i]=i;
        for(int i=1;i<=n;i++)
        {
            scanf("%s",b+1);
            a[i].push_back(0);
            for(int j=1;j<=(m+1)/2;j++)
            {
                if(b[j]=='1'||b[m+1-j]=='1') id[j].push_back(i);
                
            }
            for(int j=1;j<=m;j++) a[i].push_back(b[j]-'0');
        }
        // for(int i=1;i<=n;i++)
        // {
        //     for(int j=1;j<=m;j++)
        //         cerr<<a[i][j];
        //     cerr<<" ad"<<endl;
        // }
        bool flag=1;
        if(m%2)
        {
            if(id[(m+1)/2].size()>1) flag=0;
        }
        for(int i=1;i<=m/2;i++)
        {
            if(id[i].size()>2) {flag=0;break;}
            if(id[i].size()==2)
            {
                int id1=id[i][0],id2=id[i][1];
                int k1=a[id1][i],k2=a[id1][m+1-i];
                int k11=a[id2][i],k22=a[id2][m+1-i];
                pair<int,int> s1={k1,k2},s2={k11,k22},aim={1,1};
                // cerr<<s1.first<<' '<<s1.second<<"   "<<s2.first<<" "<<s2.second<<"  sad"<<endl;
                if(s1==aim||s2==aim) {flag=0;break;}
                
                if(s1==s2)
                {
                    int fa1=find_fa(id1),fa2=find_fa(id2);
                    if(fa1!=fa2) fa[fa2]=fa1;
                    fa1=find_fa(id1+n);fa2=find_fa(id2+n);
                    if(fa1!=fa2) fa[fa2]=fa1;
                }
                else
                {
                    int fa1=find_fa(id1),fa2=find_fa(id2+n);
                    if(fa1!=fa2) fa[fa2]=fa1;
                    fa1=find_fa(id1+n);fa2=find_fa(id2);
                    if(fa1!=fa2) fa[fa2]=fa1;
                }
            }
        }
        ll num=0LL;
        for(int i=1;i<=n;i++)
        {
            int fa1=find_fa(i),fa2=find_fa(i+n);
            if(fa1==fa2) {flag=0;break;}
            if(!vis[fa1])
            {
                vis[fa1]=1;
                num++;
            }
            if(!vis[fa2])
            {
                vis[fa2]=1;
                num++;
            }
        }
        if(flag) cout<<ksm(2LL,num/2LL)<<'\n';
        else cout<<"0\n";
        for(int i=0;i<=2*max(n,m);i++) a[i].clear();
        for(int i=0;i<=2*max(n,m);i++) vis[i]=0;
        for(int i=0;i<=2*max(n,m);i++) id[i].clear();
    }
    return 0;
}
/*

*/