#include <bits/stdc++.h>

const int64_t MOD = 1E9 + 7;

struct DSU {
    int siz;
    std::vector<int> v;
    DSU(int n) {
        siz = n;
        v.resize(n + 1);
        std::iota(v.begin(), v.end(), 0);
    }
    int find(int x) {
        return (v[x] == x ? x : (v[x] = find(v[x])));
    }
    bool merge(int x, int y) {
        if (find(x) != find(y)) {
            v[find(x)] = find(y);
            siz--;
            return true;
        }
        return false;
    }
    bool query(int x, int y) {
        return find(x) == find(y);
    }
};

int64_t power(int64_t a, int64_t b)
{
    int64_t res = 1;
    while (b > 0) {
        if (b & 1) res = res * a % MOD;
        a = a * a % MOD;
        b >>= 1;
    }
    return res;
}

void solve()
{
    int n, m;
    std::cin >> n >> m;
    std::vector<std::string> v(n);
    for (int i = 0; i < n; ++i) {
        std::cin >> v[i];
    }
    DSU dsu(n);
    for (int j = 0; j <= m / 2; ++j) {
        int cnt = 0;
        int a = -1, b = -1;
        for (int i = 0; i < n; ++i) {
            if (v[i][j] == '1') {
                cnt++;
                if (a == -1) {
                    a = i;
                } else {
                    b = i;
                }
            }
            if (v[i][m - j - 1] == '1' && m - j - 1 != j) {
                cnt++;
                if (a == -1) {
                    a = i;
                } else {
                    b = i;
                }
            }
        }
        if (cnt > 2) {
            std::cout << "0\n";
            return;
        }
        if (m % 2 == 1 && j == m / 2 && cnt > 1) {
            std::cout << "0\n";
            return;
        }
        // std::cout << a << ":" << b << " ";
        if (a != b && a != -1 && b != -1) {
            dsu.merge(a + 1, b + 1);
        }
    }
    std::cout << power(2, dsu.siz) << "\n";
}

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

    int T;
    std::cin >> T;
    while (T--) {
        solve();
    }

    return 0;
}