#include <bits/stdc++.h>
const int mod = 1e9 + 7;
using i64 = long long;
i64 qpow(i64 a, i64 b) {
    i64 res = 1;
    while(b) {
        if(b & 1) res = res * a % mod;
        b >>= 1;
        a = a * a % mod;
    }
    return res;
}
void solve() {
    int n, m; std:: cin >> n >> m;
    std::vector<std::string> mp(n + 1);
    std::vector<std::vector<int>> e(m + 1);
    std::vector<int>f(n * 2 + 1);
    auto find = [&] (auto && find, int x) -> int{
        return f[x] == x ? x : f[x] = find(find, f[x]);
    };
    for(int i = 1; i <= n; i++) {
        std:: cin >> mp[i];
        mp[i] = ' ' + mp[i];
    }
    for(int i = 1; i <= 2 * n; i++) f[i] = i;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            if(mp[i][j] == '1') e[j].push_back(i);
        }
    }
    if(m & 1) {
        if(e[(m + 1) / 2].size()  > 1) {
            std:: cout << "0\n";
            return;
        }
    }
    for(int i = 1, j = m; i < j; i++, j--) {
        if(e[i].size() + e[j].size() > 2){
            std:: cout << "0\n";
            return;
        } else if(e[i].size() == 2) {
            f[find(find, e[i][0])] = find(find, e[i][1] + n);
            f[find(find, e[i][1])] = find(find, e[i][0] + n);
        } else if(e[j].size() == 2) {
            f[find(find, e[j][0])] = find(find, e[j][1] + n);
            f[find(find, e[j][1])] = find(find, e[j][0] + n);
        } else if(e[i].size() == 1 && e[j].size() == 1) {
            if(e[i][0] != e[j][0]) {
                f[find(find, e[i][0])] = find(find, e[j][0] + n);
                f[find(find, e[j][0])] = find(find, e[i][0] + n);
            }
        }
    }
    int cnt = 0;
    for(int i = 1; i <= n; i++) if(find(find, i) == find(find, i + n)) {
        std:: cout << "0\n";
        return;
    }
    for(int i = 1; i <= 2 * n; i++) if(f[i] == i) cnt++;
    std:: cout << (cnt ? qpow(2, cnt / 2): 0) << '\n';
}
signed main() {
    int t; std:: cin >> t;
    while(t--) {
        solve();
    }
}