#include<bits/stdc++.h>
#define ll long long

using namespace std;

const int N = 1e6 + 10, mod = 1e9 + 7;

int f[N << 1];
int st[N << 1], r, c;
bool vis[N << 1];
int find(int x)
{
    if (f[x] != x)f[x] = find(f[x]);
    return f[x];
}

void merge(int x, int y) {
    f[find(x)] = find(y);
    f[find(x ^ 1)] = find(y ^ 1);
}

void solve()
{
    cin >> r >> c;
    for (int j = 0; j < c; j++)st[j] = 0;
    for (int i = 2; i <= 2 * r + 1; i++)f[i] = i, vis[i] = 0;
    ll res = 1;
    for (int i = 1; i <= r; i++) {
        string s; cin >> s;
        for (int j = 0, k = c - 1; j <= k; j++, k--) {
            if (j == k) {
                if (s[j] == '1')
                {
                    if (st[j] == mod) {
                        res = 0;
                    }
                    else st[j] = mod;
                }
            }
            else {
                if (s[j] == s[k]) {
                    if (s[j] == '1')
                    {
                        if (st[j]) res = 0;
                        st[j] = mod;
                    }
                }
                else {
                    int t = s[j] - '0';
                    if (st[j] == mod) {
                        res = 0;
                    }
                    else if (!st[j])st[j] = 2 * i + t;
                    else merge(2 * i + t, st[j]), st[j] = mod;
                }
            }
        }
    }
    for (int i = 2; i <= 2 * r + 1; i++) {
        if (find(i) == find(i ^ 1))res = 0;
    }
    for (int i = 2; i <= 2 * r; i += 2) {
        if (!vis[find(i)] && !vis[find(i ^ 1)])res = res * 2 % mod;
        vis[find(i)] = vis[find(i ^ 1)] = 1;
    }
    cout << res << '\n';
}

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