#include<bits/stdc++.h>
#include<bits/extc++.h>
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define repp(i,j,k) for(int i=j;i>=k;i--)
#define ls(x) (x<<1)
#define rs(x) ((x<<1)|1)
#define mp make_pair
#define sec second
#define fir first
#define pii pair<int,int>
#define lowbit(i) i&-i
#define int long long
using namespace std;
typedef long long ll;
const int N=1e6+5,M=1e6+5,S=(1<<15)+5,inf=(ll)1e18+7,mo=1e9+7;
void read(int &p){
	int x=0,w=1;
	char ch=0;
	while(!isdigit(ch)){
		if(ch=='-')w=-1;
		ch=getchar();
	}
	while(isdigit(ch)){
		x=(x<<1)+(x<<3)+ch-'0';
		ch=getchar();
	}
	p=x*w;
}
int T;
int n,m;
string s[N];
vector<int>h[N],fh[N];
struct bcj{
    int fa[N];
    void init(){
        rep(i,1,2*n)
            fa[i]=i;
    }
    int find(int x){
        if(fa[x]==x)return x;
        return fa[x]=find(fa[x]);
    }
    void merge(int x,int y){
        x=find(x),y=find(y);
        if(x==y)return;
        fa[x]=y;
    }
}B;
void solve(){
    read(n),read(m);
    B.init();
    rep(i,0,m-1)
        h[i].clear(),fh[i].clear();
    rep(i,1,n){
        cin>>s[i];
        rep(j,0,m-1){
            int fj=m-1-j;
            if(s[i][j]=='0')continue;
            if(!h[j].empty())B.merge(h[j].back()+n,i),B.merge(h[j].back(),i+n);
            h[j].push_back(i);
            if(!fh[j].empty())B.merge(fh[j].back(),i),B.merge(fh[j].back()+n,i+n);
            fh[fj].push_back(i);
        }
    }
    int ans=1;
    rep(i,1,n){
        if(B.find(i)==B.find(i+n)){
            puts("0");
            return;
        }
        if(B.find(i)==i)ans*=2,ans%=mo;
    }
    printf("%lld\n",ans);
}
signed main(){
    read(T);
    while(T--)
        solve();
    return 0;
}