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

#define F(a, b) fixed << setprecision(b) << a
typedef long long LL;
const LL MOD = 1e9 + 7;

struct DSU{

    vector<int> f, siz;

    DSU(){}
    DSU(int n){
        init(n);
    }

    void init(int n){
        f.resize(n + 1);
        iota(f.begin() + 1, f.end(), 1);
        siz.assign(n + 1, 1);
        return;
    }

    int find(int x){
        return x == f[x] ? f[x] : f[x] = find(f[x]);
    }

    bool same(int x, int y){
        return find(x) == find(y);
    }

    bool merge(int x, int y){
        x = find(x); y = find(y);
        if(x == y) return false;
        siz[x] += siz[y];
        f[y] = x;
        return true;
    }

    int size(int x){
        return siz[find(x)];
    }

};

LL qpow(LL base, LL b, LL p){
    LL ans = 1;
    while(b){
        if(b & 1) ans = ans * base % p;
        base = base * base % p;
        b >>= 1;
    }
    return ans;
}

void solve(){
    int r, c;
    cin >> r >> c;
    vector<vector<char>> a(r + 1, vector<char>(c + 1));
    for(int i = 1; i <= r; i++){
        for(int j = 1; j <= c; j++){
            cin >> a[i][j];
        }
    }
    if(c & 1){
        int num = 0;
        for(int i = 1; i <= r; i++)
            if(a[i][c / 2 + 1] == '1') num++;
        if(num >= 2){
            cout << "0\n";
            return;
        }
    }

    DSU dsu(2 * r + 1);

    for(int j = 1; j <= c / 2; j++){
        int num = 0;
        int xr = 0, xc = 0, yr = 0, yc = 0;
        for(int i = 1; i <= r; i++){
            if(a[i][j] == '1'){
                num++;
                if(xr) yr = i;
                else xr = i;
                if(xc) yc = j;
                else xc = j;
            }
            if(a[i][c + 1 - j] == '1'){
                num++;
                if(xr) yr = i;
                else xr = i;
                if(xc) yc = c + 1 - j;
                else xc = c + 1 - j;
            }
        }
        if(num >= 3){
            cout << "0\n";
            return;
        }
        if(num == 2){
            if(xr != yr){
                if(xc != yc){
                    dsu.merge(xr, yr);
                    dsu.merge(xr + r, yr + r);
                }else{
                    dsu.merge(xr, yr + r);
                    dsu.merge(yr, xr + r);
                }
            }
        }
    }

    vector<bool> vis(r + 1);
    int fnum = 0;
    for(int i = 1; i <= 2 * r; i++){
        if(i <= r && dsu.find(i) == dsu.find(i + r)){
            cout << "0\n";
            return;
        }
        if(!vis[dsu.find(i)]){
            fnum++;
            vis[dsu.find(i)] = true;
        }
    }

    cout << qpow(2LL, fnum >> 1, MOD) << "\n";
    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin >> T;
    while(T--){
        solve();
    }
    return 0;
}