#include <bits/stdc++.h>
#include <iostream>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define i128 _int128
#define fi first
#define se second 
#define pb push_back
#define endl '\n'
#define int long long

const ll INF = 0x3f3f3f3f;
const ll N = 1e6 + 9;
const int mod = 1e9 + 7;

// inline int read(){
//     int ans=0,sign=1;
//     char ch = getchar();
//     while(ch<'0'||ch>'9'){
//         if(ch=='-'){
//             sign=-1;
//         }
//         ch=getchar();
//     }
//     while(ch>='0'&&ch<='9'){
//         ans = ans*10 + ch-'0';
//         ch = getchar();
//     }
//     return ans*sign;
// }

int fp(int a, int x, int mod) {
    int ans = 1;
    while (x) {
        if (x & 1)ans *= a % mod;
        a *= a % mod;
        a %= mod;
        x /= 2;
    }
    return ans %= mod;
}


int fa[2 * N];
int cc[N];
vector<int>ccc[N];
map<int, int>ans;
set<int>p;
//vector<string> s;
int find(int p) {
    if (fa[p] != p)return fa[p] = find(fa[p]);
    else return fa[p];
}

void solve() {

    int r, c;
    cin >> r >> c;
    bool flag = 0;
    char s[r + 1][c + 1];
    //s.resize(r+2);
    //初始化
    //p.clear();
    for (int i = 1; i <= 2 * r; i++) {
        fa[i] = i;
        //s[i].resize(c + 2);
    }
    for (int i = 1; i <= c; i++) {
        ccc[i].clear();
        cc[i]=0;
    }
    //
    for (int i = 1; i <= r; i++) {
        for (int j = 1; j <= c; j++) {
            cin >> s[i][j];
            
            if (s[i][j] == '1') {
                cc[j]++;
                //cc[c-j+1]++;
                ccc[j].push_back(i);
                if (cc[j] + cc[c - j + 1] > 2) {
                    flag = 1;
                }
            }
        }
    }
    if (flag) {
        cout << 0 << endl;
        return;
    }
    for (int i = 1; i <= c; i++) {
        int k1 = i, k2 = c - i + 1;
        k2 %= c+1;
        if (k1 == k2)break;
        if (cc[k1] + cc[k2] == 2) {

            if (cc[k1] == 2 || cc[k2] == 2) {
                int kk;
                if (cc[k1] == 2)kk = k1;
                else kk = k2;
                int i1 = ccc[kk][0];
                int i2 = ccc[kk][1];
                fa[find(i1)] = fa[find(i2)];
                fa[find(i1 + r)] = fa[find(i1 + r)];
            }
            else {
                int i1 = ccc[k1][0];
                int i2 = ccc[k2][0];
                if (i1 == i2)continue;
                fa[find(i1)] = fa[find(i2 + r)];
                fa[find(i1 + r)] = fa[find(i2)];
            }
        }
    }
    int cnt = 0;
    for (int i = 1; i <= r; i++) {
        if (find(i) == find(i + r)) {
            cout << 0 << endl;
            return;
        }
        else {
            if(find(i)==i)cnt++;//cout<<i<<" ";
            if(find(i+r)==i+r)cnt++;//,cout<<i+r<<" ";
        }
    }
    //cout<<endl;
    cnt/=2;
    //cout<<cnt<<endl;
    cout << fp(2, cnt, mod) << endl;
    // cout<<r<<" "<<c<<endl;
    // for(int i=1;i<=r;i++){
    //     for(int j=1;j<=c;j++){
    //         cout<<s[i][j];
    //     }
    //     cout<<endl;
    // }
    //cout<<endl;
}





signed main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int _ = 1;
    // fac[0]=1;
    // for(int i=1;i<=N-9;++i)fac[i]=(fac[i-1]*i)%mod;
    cin >> _;

    while (_--)solve();

    return 0;
}