#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstring>
#define int long long
using namespace std;
const int p=1e9+7;
const int MX=1000010;

int T;
int fa[MX], siz[MX], num[MX];
vector<int> add;
int read()
{
    int r=0, f=1; char ch=getchar();
    while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}
    while(ch>='0'&&ch<='9') {r=r*10+ch-'0'; ch=getchar();}
    return r*f;
}
int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
void merge(int x, int y)
{
    // cout << "x=" << x << ", y=" << y << '\n';
    x=find(x), y=find(y);
    if(x>y) swap(x,y);
    fa[y]=x;
    siz[x]+=siz[y];
}
signed main()
{
    // freopen("testdata.in","r",stdin);
    T=read();
    while(T--)
    {
        int r=read(), c=read();
        vector<vector<int>> v(r,vector<int>(c));
        for(int i=1;i<=c;i++) fa[i]=i, num[i]=0;
        for(int i=0;i<r;i++)
        {
            // cout << "i=" << i << '\n';
            string s; cin >> s;
            add.clear();
            for(int j=0;j<c;j++) 
            {
                v[i][j]=s[j]-'0';
                if(s[j]=='1') 
                {
                    add.emplace_back(j+1); add.emplace_back(c-j);  
                    num[j+1]++; num[c-j]++;
                }
            }
            for(auto u:add) 
            {
                // cout << "   u=" << u << '\n';
                merge(u,add.back());
            }
        }
        int tag=0;
        for(int i=1;i<=c;i++)
            if(num[i]>2) {tag=1; break;}
        if(tag) {cout << "0\n"; continue;}
        int ans=1;
        for(int i=1;i<=c;i++)
            if(find(i)==i&&num[i]) ans=ans*2%p;
        cout << ans << '\n';
    }
    return (0-0);
}