#pragma GCC optimize(3, "Ofast", "inline")
#include <iostream>
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define INF 0x3f3f3f3f
#define L_INF 0x7f3f3f3f3f3f3f3f
#define db cout << "debug\n";

using namespace std;
const int Mod = 998244353;
using ll = long long;

// vector<pair<int, int>> e[1000005];
int Next[2000005], TOT, head[2000005], Go[2000005];
bool Val[2000005];
const int mod = 1e9 + 7;
int vis[1000005];
string Str, str;
ll ans;
int L, R, que[2000005];
inline void dfs(int u, int fa)
{
    // cout << u << ' ' << fa << '\n';
    // for (int i = head[u]; i; i = Next[i])
    // {
    //     if (Go[i] == fa)
    //         continue;
    //     if (vis[Go[i]] != -1 && vis[Go[i]] != vis[u] ^ Val[i])
    //     {
    //         // cout << "SS " << u << ' ' << v << ' ' << vis[u] << " " << vis[v] << '\n';
    //         ans = 0;
    //         return;
    //     }
    //     vis[Go[i]] = vis[u] ^ Val[i];
    //     dfs(Go[i], u);
    //     if (ans == 0)
    //         return;
    // }
    que[1] = u;
    L = R = 1;
    while (R >= L)
    {
        for (int i = head[que[L]]; i; i = Next[i])
        {
            if (vis[Go[i]] == -1)
            {
                vis[Go[i]] = vis[que[L]] ^ Val[i];
                que[++R] = Go[i];
                continue;
            }
            if (vis[Go[i]] != vis[que[L] ^ Val[i]])
            {
                ans = 0;
                return;
            }
        }
        L++;
    }
}

inline void ADD(ll u, ll v, ll w)
{
    Next[++TOT] = head[u];
    head[u] = TOT;
    Go[TOT] = v;
    Val[TOT] = w;
}

void solve()
{
    int r, c;
    cin >> r >> c;
    TOT = 0;
    Str = "";
    for (int i = 1; i <= r; i++)
    {
        vis[i] = -1;
        cin >> str;
        Str = Str + str;
        head[i] = 0;
    }
    ans = 1;
    for (int j = 1; j <= (c + 1) / 2; j++)
    {
        int u[2], fh = 0, f[2];
        for (int i = 1; i <= r; i++)
        {
            if (Str[(i - 1) * c + j - 1] == '1')
            {
                if (fh == 2)
                {
                    fh = 3;
                    break;
                }
                u[fh] = i;
                f[fh++] = 0;
            }
        }
        if (fh == 3)
        {
            ans = 0;
            break;
        }
        for (int i = 1; i <= r; i++)
        {
            if (Str[i * c - j] == '1')
            {
                if (fh == 2)
                {
                    fh = 3;
                    break;
                }
                u[fh] = i;
                f[fh++] = 1;
            }
        }
        if (fh == 3)
        {
            ans = 0;
            break;
        }
        if (fh <= 1 || u[0] == u[1])
            continue;
        // cout << u[0] << ' ' << u[1] << '\n';
        ADD(u[0], u[1], (f[0] == f[1]));
        ADD(u[1], u[0], (f[0] == f[1]));
    }
    for (int i = 1; i <= r; i++)
    {
        if (vis[i] != -1)
            continue;
        vis[i] = 0;
        dfs(i, 0);
        ans = ans * 2 % mod;
    }
    // for (int i = 1; i <= r; i++)
    // {
    //     cout << vis[i] << '\n';
    // }
    cout << ans << '\n';
}
int main()
{
    IOS;
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#ifndef ONLINE_JUDGE
    clock_t start_time = clock();
#endif
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
#ifndef ONLINE_JUDGE
    cout << "Used " << (double)(clock() - start_time) << " ms" << endl;
#endif
    return 0;
}