#include<bits/stdc++.h>
#define fore(i,l,r)	for(int i=(int)(l);i<(int)(r);++i)
#define fi first
#define se second
#define endl '\n'
#define ull unsigned long long
#define ALL(v) v.begin(), v.end()
#define Debug(x, ed) std::cerr << #x << " = " << x << ed;

const int INF=0x3f3f3f3f;
const long long INFLL=1e18;

typedef long long ll;

template<class T>
constexpr T power(T a, ll b){
    T res = 1;
    while(b){
        if(b&1) res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}

constexpr ll mul(ll a,ll b,ll mod){ //快速乘，避免两个long long相乘取模溢出
    ll res = a * b - ll(1.L * a * b / mod) * mod;
    res %= mod;
    if(res < 0) res += mod; //误差
    return res;
}

template<ll P>
struct MLL{
    ll x;
    constexpr MLL() = default;
    constexpr MLL(ll x) : x(norm(x % getMod())) {}

    static ll Mod;
    constexpr static ll getMod(){
       if(P > 0) return P;
       return Mod;
    }

    constexpr static void setMod(int _Mod){
       Mod = _Mod;
    }
    constexpr ll norm(ll x) const{
       if(x < 0){
           x += getMod();
       }
       if(x >= getMod()){
           x -= getMod();
       }
       return x;
    }
    constexpr ll val() const{
       return x;
    }
    explicit constexpr operator ll() const{ 
       return x; //将结构体显示转换为ll类型： ll res = static_cast<ll>(OBJ)
    }
    constexpr MLL operator -() const{ //负号，等价于加上Mod
       MLL res;
       res.x = norm(getMod() - x);
       return res;
    }
    constexpr MLL inv() const{
       assert(x != 0);
       return power(*this, getMod() - 2); //用费马小定理求逆
    }
    constexpr MLL& operator *= (MLL rhs) & { //& 表示“this”指针不能指向一个临时对象或const对象
       x = mul(x, rhs.x, getMod()); //该函数只能被一个左值调用
       return *this;
    }
    constexpr MLL& operator += (MLL rhs) & {
       x = norm(x + rhs.x);
       return *this;
    }
    constexpr MLL& operator -= (MLL rhs) & {
       x = norm(x - rhs.x);
       return *this;
    }
    constexpr MLL& operator /= (MLL rhs) & {
       return *this *= rhs.inv();
    }
    friend constexpr MLL operator * (MLL lhs, MLL rhs){
       MLL res = lhs;
       res *= rhs;
       return res;
    }
    friend constexpr MLL operator + (MLL lhs, MLL rhs){
       MLL res = lhs;
       res += rhs;
       return res;
    }
    friend constexpr MLL operator - (MLL lhs, MLL rhs){
       MLL res = lhs;
       res -= rhs;
       return res;
    }
    friend constexpr MLL operator / (MLL lhs, MLL rhs){
       MLL res = lhs;
       res /= rhs;
       return res;
    }
    friend constexpr std::istream& operator >> (std::istream& is, MLL& a){
       ll v;
       is >> v;
       a = MLL(v);
       return is;
    }
    friend constexpr std::ostream& operator << (std::ostream& os, MLL& a){
       return os << a.val();
    }
    friend constexpr bool operator == (MLL lhs, MLL rhs){
       return lhs.val() == rhs.val();
    }
    friend constexpr bool operator != (MLL lhs, MLL rhs){
       return lhs.val() != rhs.val();
    }
};

const ll mod = 1e9 + 7;
using Z = MLL<mod>;
template<>
ll MLL<0ll>::Mod = 998244353;
//using Z = MLL<0ll>;

void solve(){
    int n, m;
    std::cin >> n >> m;
    std::vector<std::vector<int>> a(n + 1, std::vector<int>(m + 1));
    std::vector<std::vector<std::pair<int, int>>> g(n + m + 1);
    fore(i, 1, n + 1){
        std::string s;
        std::cin >> s;
        s = '0' + s;
        fore(j, 1, m + 1) a[i][j] = (s[j] == '1');
    }

    fore(j, 1, m + 1){
        int cnt = 0;
        fore(i, 1, n + 1) cnt += a[i][j];
        if(cnt > 2){
            std::cout << "0\n";
            return;
        }
        if(j == m - j + 1 && cnt == 2){
            std::cout << "0\n";
            return;
        }
    }

    std::vector<std::vector<int>> col(m + 1);
    fore(i, 1, n + 1)
        fore(j, 1, m + 1)
            if(a[i][j])
                col[j].push_back(i);

    auto addedge = [&](int u, int v, int w){
        g[u].push_back({v, w});
        g[v].push_back({u, w});
    };

    fore(i, 1, n + 1){
        fore(j, 1, m + 1)
            if(a[i][j]){
                for(auto v : col[j])
                    if(i > v) addedge(i, v, 3);
                for(auto v : col[m - j + 1])
                    if(i > v) addedge(i, v, 0);
            }
    }

    Z ans = 1;
    std::vector<int> c(n + 1);
    
    auto dfs = [&](auto self, int u) -> bool {
        for(auto [v, w] : g[u]){
            if(c[v] && c[v] != c[u] ^ w) return false;
            if(c[v]) continue;
            c[v] = c[u] ^ w;
            self(self, v);
        }

        return true;
    };

    fore(i, 1, n + 1)
        if(!c[i]){
            c[i] = 1;
            if(!dfs(dfs, i)){
                std::cout << "0\n";
                return;
            }
            ans *= 2;
        }


    std::cout << ans << endl;
}

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