#pragma comment(linker, "/STACK:102400000,102400000")//手动开大栈区
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
const int N=2e6+10;
const ll mod=1e9+7;
int n,m;
string s,ss[N];
vector<int> pos,vis;
void init(){
    pos.resize(N);
    vis.resize(N);
}
void solve(){
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>ss[i];
    }
    vector<int>e[n+1];
    for(int i=0;i<=n;i++){
        e[i].clear();
        vis[i]=0;
    }
    for(int i=0;i<=m;i++){
        pos[i]=0;
    }
    for(int i=1;i<=n;i++){
        s=ss[i];
        //s[i]=" "+s[i];
        bool flag=0;
        for(int j=0;j<m;j++){
            if(pos[j]!=0&&s[j]=='1'){
                flag=1;
                e[i].push_back(pos[j]);
                e[pos[j]].push_back(i);
            }
        }
        if(flag){
            reverse(s.begin(),s.end());
            for(int j=0;j<m;j++){
                if(pos[j]!=0&&s[j]=='1'){
                    cout<<0<<endl;
                    return;
                }
                if(s[j]=='1'){
                    pos[j]=i;
                }
            }
        }else{
            reverse(s.begin(),s.end());
            for(int j=0;j<m;j++){
                if(pos[j]!=0&&s[j]=='1'){
                    e[i].push_back(pos[j]);
                    e[pos[j]].push_back(i);
                }
            }
            reverse(s.begin(),s.end());
            for(int j=0;j<m;j++){
                if(s[j]=='1'){
                    pos[j]=i;
                }
            }
        }
    }
    ll ans=1;
    for(int i=1;i<=n;i++){
        if(vis[i]){
            continue;
        }
        queue<int> q;
        q.push(i);
        while(q.size()!=0){
            int x=q.front();
            q.pop();
            if(vis[x]){
                continue;
            }
            vis[x]=1;
            for(auto v:e[x]){
                if(vis[v]){
                    continue;
                }
                q.push(v);
            }
        }
        ans=(ans*2)%mod;
    }
    cout<<ans<<endl;
}


int main() 
{
	std::ios::sync_with_stdio(false);
	cin.tie(0); 
	cout.tie(0);
	int _=1;
    init();
    cin>>_;
	while(_--){
		solve();
	}
    return 0;
}