#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;
string s[1000005];
vector<pair<int, int>> e[1000005];
const int mod = 1e9 + 7;
int vis[1000005];
int dfs(int u, int fa)
{
    // cout << u << ' ' << fa << '\n';
    for (auto [v, ch] : e[u])
    {
        if (v == fa)
            continue;
        if (vis[v] != -1 && vis[v] != vis[u] ^ ch)
        {
            // cout << "SS " << u << ' ' << v << ' ' << vis[u] << " " << vis[v] << '\n';
            return 0;
        }
        else if (vis[v] != -1)
            continue;
        vis[v] = vis[u] ^ ch;
        if (dfs(v, u) == 0)
            return 0;
    }
    return 1;
}
void solve()
{
    int r, c;
    cin >> r >> c;
    for (int i = 1; i <= r; i++)
    {
        e[i].clear();
        vis[i] = -1;
        cin >> s[i];
        s[i] = " " + s[i];
    }
    ll ans = 1;
    for (int j = 1; j <= (c + 1) / 2; j++)
    {
        vector<int> tmp1;
        vector<int> tmp0;
        for (int i = 1; i <= r; i++)
        {
            if (s[i][j] == '1')
                tmp1.push_back(i);
        }
        for (int i = 1; i <= r; i++)
        {
            if (s[i][c - j + 1] == '1')
                tmp0.push_back(i);
        }
        if (tmp1.size() > 2 || tmp0.size() > 2)
            ans = 0;
        for (auto x1 : tmp1)
        {
            for (auto x2 : tmp0)
            {
                if (x1 == x2)
                    continue;
                e[x1].push_back({x2, 0});
                e[x2].push_back({x1, 0});
            }
        }
        for (auto x1 : tmp1)
        {
            for (auto x2 : tmp1)
            {
                if (x1 == x2)
                    continue;
                e[x1].push_back({x2, 1});
                e[x2].push_back({x1, 1});
            }
        }
        for (auto x1 : tmp0)
        {
            for (auto x2 : tmp0)
            {
                if (x1 == x2)
                    continue;
                e[x1].push_back({x2, 1});
                e[x2].push_back({x1, 1});
            }
        }
    }
    for (int i = 1; i <= r; i++)
    {
        if (vis[i] != -1)
            continue;
        vis[i] = 0;
        if (dfs(i, 0))
        {
            ans = ans * 2 % mod;
        }
        else
        {
            // cout << i << "\n";
            ans = 0;
        }
    }
    // 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;
}