#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];
string b;
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++)
        {
            cin>>b;
            b=' '+b;
            a[i].push_back(0);
            for(int j=1;j<=m;j++)
            {
                int idk=min(j,m+1-j);
                if(b[j]=='1')
                {
                    if(j>idk)
                    {
                        if(b[idk]!='1') id[idk].push_back(i);
                    }
                    else id[idk].push_back(i);
                }
                
                a[i].push_back(b[j]-'0');
            }
        }
        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 k1=a[id[i][0]][i],k2=a[id[i][0]][m+1-i];
                int k11=a[id[i][1]][i],k22=a[id[i][1]][m+1-i];
                if(k1==k2&&k1==1) {flag=0;break;}
                if(k11==k22&&k11==1) {flag=0;break;}
                assert(id[i][1]!=id[i][0]);
                if((k1==1&&k11==1)||(k1==0&&k11==0))
                {
                    int fa1=find_fa(id[i][0]),fa2=find_fa(id[i][1]);
                    if(fa1!=fa2) fa[fa2]=fa1;
                    fa1=find_fa(id[i][0]+n);fa2=find_fa(id[i][1]+n);
                    if(fa1!=fa2) fa[fa2]=fa1;
                }
                else
                {
                    int fa1=find_fa(id[i][0]),fa2=find_fa(id[i][1]+n);
                    if(fa1!=fa2) fa[fa2]=fa1;
                    fa1=find_fa(id[i][0]+n);fa2=find_fa(id[i][1]);
                    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<=n;i++) a[i].clear();
        for(int i=0;i<=2*n;i++) vis[i]=0;
        for(int i=0;i<=m;i++) id[i].clear();
    }
    return 0;
}
/*

*/