#include <bits/stdc++.h>
#define rep(a,b,c) for(int a=(b);a<=(c);a++)
#define per(a,b,c) for(int a=(b);a>=(c);a--)
#define vi vector<int>
#define pb emplace_back
#define ll long long
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;

template<class T>inline void read(T &x) {
	T f=1; x=0; char s=getchar();
	while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
	while(s>='0'&&s<='9'){x=x*10+s-'0';s=getchar();}
	x*=f;
}

const int p=1e9+7;
const int N=1e6;
inline int ksm(int a,int b) { int ans=1; for(;b;b>>=1,a=1ll*a*a%p) if(b&1) ans=1ll*a*ans%p; return ans; }

int n,m,vs[N+5],xl[N+5],sz;

vi rw[N+5],cl[N+5],e[N+5];

char s[N+5];

inline void dfs(int x) {
    vs[x]=1;
    for(int v:e[x]) if(!vs[v]) dfs(v);
}

inline void solve() {
    read(n); read(m);
    rep(i,1,n) vs[i]=0;
    rep(i,1,n) e[i].clear();
    rep(i,1,n) rw[i].clear();
    rep(i,1,m) cl[i].clear();
    rep(i,1,n) {
        scanf("%s",s+1);
        rep(j,1,m) if(s[j]=='1') cl[j].pb(i);
    }
    if(m&1) {
        if(cl[(m+1)/2].size()>=2) {
            puts("0");
            return;
        }
    }
    rep(i,1,m/2) {
        if((cl[i].size()+cl[m-i+1].size())>2) {
            puts("0");
            return;
        }
        if((cl[i].size()+cl[m-i+1].size())==2) {
            sz=0;
            for(int x:cl[i]) xl[++sz]=x;
            for(int x:cl[m-i+1]) xl[++sz]=x;
            if(xl[1]!=xl[2]) e[xl[1]].pb(xl[2]),e[xl[2]].pb(xl[1]);
        }
    }
    int ans=0;
    rep(i,1,n) if(!vs[i]) dfs(i),ans++;
    printf("%d\n",ksm(2,ans));
}

int main() {
	int T; read(T); while(T--)
	solve();
}