#include<bits/stdc++.h>
using namespace std;

typedef long long LL;
#define int long long
typedef unsigned long long ULL;
typedef pair<LL, LL>PII;
typedef pair<double, double>PDD;
typedef pair<char, char>PCC;
LL n, m, k;

const LL inf = 1e18;
const LL N = 1e6 + 10;
const LL mod = 1e9 + 7;
int fa[N];
int qmi(int a,int b){
    int res = 1;
    while(b){
        if(b&1)res = res*a%mod;
        a = a*a%mod;
        b>>=1;
    }
    return res;
}
int find(int i){
    return fa[i]==i?fa[i]:(fa[i] =find(fa[i]));
}


void solve(){
    cin>>n>>m;
    for(int i = 1;i<=n;i++){
        fa[i] = i;
    }
    vector<string>a(n+1);
    for(int i = 1;i<=n;i++){
        cin>>a[i];
        a[i] = " "+a[i];
    }

    map<PII,int> mp;
    int i = 1,j = m;
    while(i<j){
            vector<int>pos1;
            vector<int>pos2;
            int cnt = 0;
        for(int k = 1;k<=n;k++){
            if(a[k][i]=='1'){
                pos1.push_back(k);
                ++cnt;
            }
            if(a[k][j]=='1'){
                ++cnt;
                pos2.push_back(k);
            }
        }
        if(cnt>2){
            cout<<0<<"\n";
            return;
        }
        i++,j--;
        if(cnt<=1)continue;
        if(pos1.size()==2){
            int x = pos1[0];
            int y = pos1[1];
            if(x == y) continue;
            else if(x > y) swap(x,y);
            if(mp.find({x,y}) != mp.end())
            {
                if(mp[{x,y}] != 1)
                {
                    cout<<0<<"\n";
                    return;
                }
            }
            mp[{x,y}] = 1;
            int fx = find(x);
            int fy = find(y);

            fa[fx] = fy;
            find(fx);
        }
        else if(pos2.size()==2){
            int x = pos2[0];
            int y = pos2[1];
            if(x == y) continue;
            else if(x > y) swap(x,y);
            if(mp.find({x,y}) != mp.end())
            {
                if(mp[{x,y}] != 1)
                {
                    cout<<0<<"\n";
                    return;
                }
            }
            mp[{x,y}] = 1;
            int fx = find(x);
            int fy = find(y);

            fa[fx] = fy;
            find(fx);
        }
        else{
            int x = pos1[0];
            int y = pos2[0];
            if(x == y)continue;
            else if(x > y) swap(x,y);
            if(mp.find({x,y}) != mp.end())
            {
                if(mp[{x,y}] != 0)
                {
                    cout<<0<<"\n";
                    return;
                }
            }
            mp[{x,y}] = 0;
            int fx = find(x);
            int fy = find(y);
            fa[fx] = fy;
            find(fx);
        }

    }
    if(i==j){
        int cnt = 0;
        for(int k = 1;k<=n;k++){
            if(a[k][i]=='1')++cnt;
        }
        if(cnt>=2){
            cout<<0<<"\n";
            return;
        }
    }
    int cnt = 0;
    for(int i = 1;i<=n;i++){
            find(i);
        if(fa[i]==i){
            ++cnt;
        }
    }
    int ans = qmi(2,cnt);
    cout<<ans<<"\n";
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}