#include <bits/stdc++.h>
using namespace std;
using LL = long long;
constexpr int mod = 1e9 + 7;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

LL power(LL a, LL b) {
    LL ans = 1 % mod;
    for (; b; b >>= 1, a = a * a % mod) {
        if (b & 1) {
            ans = ans * a % mod;
        }
    }
    return ans;
}

void solve() {
    int n, m;
    cin >> n >> m;
    vector<string> s(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> s[i];
        s[i] = " " + s[i];
    }

    vector<int> fa(2 * n + 1);
    iota(fa.begin(), fa.end(), 0);

    auto find = [&](int x) -> int {
        while (x != fa[x]) {
            x = fa[x] = fa[fa[x]];
        }
        return x;
    };

    auto merge = [&](int x, int y) -> bool {
        x = find(x);
        y = find(y);

        if (x == y) {
            return false;
        }
        fa[y] = x;
        return true;
    };

    auto same = [&](int x, int y) -> bool {
        return find(x) == find(y);
    };

    vector<vector<int>> a(m + 1);
    for (int j = 1; j <= (m + 1) / 2; j++) {
        for (int i = 1; i <= n; i++) {
            if (s[i][j] == '1') {
                a[j].push_back(i);
            }
            if (s[i][m - j + 1] == '1') {
                a[j].push_back(i);
            }
        }

        if (a[j].size() > 2) {
            cout << 0 << "\n";
            return;
        }

        if (a[j].size() == 2) {
            int x = a[j][0], y = a[j][1];
            if (x == y) continue;
            if (s[x][j] == s[y][j]) {
                merge(x, y);
            } else {
                merge(x, y + n);
                merge(y, x + n);
            }
        }
    }

    for (int i = 1; i <= n; i++) {
        if (same(i, i + n)) {
            cout << 0 << "\n";
            return;
        }
    }

    int cnt = 0;
    for (int i = 1; i <= 2 * n; i++) {
        if (fa[i] == i) {
            cnt++;
        }
    }
    cout << power(2, cnt / 2) << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}