#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define rep(i, l, r) for (int i = l; i <= r; i++)
#define frep(i, l, r) for (int i = l; i >= r; i--)
#define eb emplace_back
#define pb push_back
#define endl "\n"
#define int long long
using namespace std;
using ll = long long;
using PII = pair<int, int>;
const int N = 1e6 + 3;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
int n, m;
int fa[N][3], vis[N], w[N];
bool tag;
vector<vector<int>> ve;
int find(int x, int id) { return fa[x][id] == x ? x : (fa[x][id] = find(fa[x][id], id)); }
void merge(int x, int y, int id) { fa[find(x, id)][id] = find(y, id); }
void dfs(int x, int p)
{
    if (!vis[x])
    {
        vis[x] = 1;
        w[x] = p;
        for (auto k : ve[x])
        {
            dfs(k, p ^ 1);
        }
    }
    else
    {
        if (w[x] != p)
        {
            tag = false;
            return;
        }
    }
}
void solve()
{
    cin >> n >> m;
    string s[n + 10];
    rep(i, 1, n)
    {
        cin >> s[i];
        s[i] = '!' + s[i];
        fa[i][0] = fa[i][1] = fa[i][2] = i;
        vis[i] = 0;
        w[i] = -1;
    }
    vector<int> a(m + 10, 0);
    rep(i, 1, n)
    {
        rep(j, 1, (m + 1) / 2)
        {
            if (s[i][j] == '1')
                a[j]++;
            if (s[i][m - j + 1] == '1' && j != m - j + 1)
                a[j]++;
            if (a[j] > 2)
                return cout << "0" << endl, void();
        }
    }
    vector<PII> b(m + 10, {0, 0});
    vector<int> vis1(m + 10, 0);
    rep(i, 1, n)
    {
        rep(j, 1, (m + 1) / 2)
        {
            if (s[i][j] == '1')
            {
                if (!vis1[j])
                {
                    b[j] = {i, 1};
                    vis1[j] = 1;
                }
                else if (b[j].second == 2)
                {
                    merge(b[j].first, i, 0);
                    merge(b[j].first, i, 2);
                }
            }
            if (s[i][m - j + 1] == '1')
            {
                if (!vis1[j])
                {
                    b[j] = {i, 2};
                    vis1[j] = 1;
                }
                else if (b[j].second == 1)
                {
                    merge(b[j].first, i, 0);
                    merge(b[j].first, i, 2);
                }
            }
        }
    }
    ve.assign(n + 10, vector<int>());
    vector<PII> c(m + 10, {0, 0});
    vector<int> vis2(m + 10, 0);
    rep(i, 1, n)
    {
        rep(j, 1, (m + 1) / 2)
        {
            if (s[i][j] == '1')
            {
                if (!vis2[j])
                {
                    c[j] = {i, 1};
                    vis2[j] = 1;
                }
                else if (c[j].second == 1)
                {
                    if (find(c[j].first, 0) == find(i, 0))
                        return cout << "0" << endl, void();
                    merge(c[j].first, i, 1);
                    ve[c[j].first].push_back(i);
                    ve[i].push_back(c[j].first);
                    // cerr << c[j].first << " " << i << endl;
                    merge(c[j].first, i, 2);
                }
            }
            if (s[i][m - j + 1] == '1')
            {
                if (!vis2[j])
                {
                    c[j] = {i, 2};
                    vis2[j] = 1;
                }
                else if (c[j].second == 2)
                {
                    if (find(c[j].first, 0) == find(i, 0))
                        return cout << "0" << endl, void();
                    merge(c[j].first, i, 1);
                    ve[c[j].first].push_back(i);
                    ve[i].push_back(c[j].first);
                    // cerr << c[j].first << " " << i << endl;
                    merge(c[j].first, i, 2);
                }
            }
        }
    }
    tag = true;
    rep(i, 1, n)
    {
        if (!vis[i])
            dfs(i, 0);
    }
    if (!tag)
        return cout << "0" << endl, void();
    int ans = 1;
    rep(i, 1, n)
    {
        if (fa[i][2] == i)
            ans = ans * 2 % mod;
    }
    cout << ans << endl;
}

signed main()
{
    IOS;
    int T = 1;
    cin >> T;
    while (T--)
        solve();
}

/*
对称的两个位置占满了 // 对称位置上占了一个空了一个 // 对称位置上没有东西
1,3 yes 2,3yes 1,2no
100100
100010
011000

1,3yes 2,4yes 1,2no
110000
101000
000010
000100

1
2 7
1001001
0101010
*/