#include <bits/stdc++.h>
using ll = long long;
using namespace std;
using pii = pair<int, int>;
const int N = 1e6 + 5;
const int P = 1e9 + 7;
ll n, m, ans;
string s[N];
void solve() {
    cin >> n >> m;
    vector<vector<int>> c(m + 2);
    for (int i = 1; i <= n; i++) {
        cin >> s[i];
        s[i] = ' ' + s[i];
        for (int j = 1; j <= m; j++) {
            if (s[i][j] == '1') {
                c[j].push_back(i);
            }
        }
    }
    for (int j = 1; j <= (m + 1) / 2; j++) {
        if (c[j].size() + c[m - j + 1].size() > 2) {
            cout << "0\n";
            return;
        }
    }
    vector<int> f(4 * n);
    for (int i = 1; i <= 2 * n; i++) {
        f[i] = i;
    }
    auto find = [&](auto find, int i) -> int {
        return f[i] == i ? i : f[i] = find(find, f[i]);
    };
    auto unit = [&](int x, int y) {
        x = find(find, x);
        y = find(find, y);
        if (x == y) {
            return;
        }
        f[y] = x;
    };
    for (int j = 1; j <= (m + 1) / 2; j++) {
        if (c[j].size() + c[m - j + 1].size() == 2) {
            if (c[j].size() && c[m - j + 1].size()) {
                int x = c[j][0];
                int y = c[m - j + 1][0];
                if (x == y) {
                    continue;
                }
                unit(x, y + n);
                unit(y, x + n);
            } else if (c[j].size() == 2) {
                int x = c[j][0];
                int y = c[j][1];

                unit(x, y);
                unit(y + n, x + n);
            } else {
                int x = c[m - j + 1][0];
                int y = c[m - j + 1][1];
                unit(x, y);
                unit(y + n, x + n);
            }
        }
    }
    set<int> se;
    for (int i = 1; i <= 2 * n; i++) {
        // cout << find(find, i) << "\n";
        if (find(find, i) == find(find, i + n)) {
            cout << "0\n";
            return;
        }
        se.insert(find(find, i));
    }
    int k = se.size() / 2;
    ans = 1;
    for (int i = 1; i <= k; i++) {
        ans *= 2;
        ans %= P;
    }
    cout << ans << '\n';
}

int main() {
    // std::ios::sync_with_stdio(false);

    // std::cin.tie(nullptr);

    int _ = 1;
    cin >> _;

    while (_--) {
        solve();
    }

    return 0;
}