#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1e9 + 7;
const int N = 1e6 + 6;
int fa[N];

int quick(int a,int n){
    a %= mod;
    int ans = 1;
    while(n){
        if(n & 1){
            ans = ans * a % mod;
        }
        a = a * a % mod;
        n >>= 1;
    }
    return ans;
}

void init(int n){
    for(int i = 1;i <= n;i++){
        fa[i] = i;
    }
}

int get_fa(int x){
    if(fa[x] != x){
        fa[x] = get_fa(fa[x]);
    }
    return fa[x];
}

void unite(int x,int y){
    x = get_fa(x);
    y = get_fa(y);
    if(x != y){
        fa[x] = y;
    }
}

int solve(){
    int n = 0,m = 0;
    cin >> n >> m;
    init(n);
    vector<string>s(n + 1);
    for(int i = 1;i <= n;i++){
        cin >> s[i];
        s[i] = ' ' + s[i];
    }
    vector<vector<int>>v(m + 1);
    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= m;j++){
            if(s[i][j] == '1'){
                v[j].push_back(i);
                v[m + 1 - j].push_back(i);
            }
        }
    }
    for(int i = 1;i <= m;i++){
        if((int)v[i].size() > 2){
            return 0;
        }
        for(int j = 1;j < (int)v[i].size();j++){
            unite(v[i][0],v[i][j]);
        }
    }
    int num = 0;
    for(int i = 1;i <= n;i++){
        if(get_fa(i) == i){
            num++;
        }
    }
    int ans = quick(2,num);
    return ans;
}

signed main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int t = 0;
    cin >> t;
    while(t--){
        int ans = solve();
        cout << ans << endl;
    }
    return 0;
}