#include <bits/stdc++.h>

#define int ll
using ll = long long;

const int mod = 1e9 + 7;

using namespace std;

struct SCC
{
    vector<vector<int>> e;
    vector<int> siz;
    vector<int> scc;
    vector<int> dfn;
    vector<int> low;
    vector<bool> ins;
    stack<int> sck;
    int sccn;
    int id;
    int n;

    void dfs(int x)
    {
        ins[x] = 1;
        dfn[x] = ++id;
        low[x] = dfn[x];
        sck.push(x);

        for (auto it : e[x])
        {
            if (!dfn[it])
            {
                dfs(it);
                low[x] = min(low[x], low[it]);
            }
            else if (ins[it])
            {
                low[x] = min(low[x], dfn[it]);
            }
        }

        if (low[x] == dfn[x])
        {
            scc[x] = ++sccn;
            ins[x] = 0;
            siz[sccn] = 1;
            while (sck.top() != x)
            {
                scc[sck.top()] = sccn;
                ins[sck.top()] = 0;
                siz[sccn]++;
                sck.pop();
            }
            sck.pop();
        }
    }

    SCC(int len)
    {
        e.resize(len + 5);
        siz.resize(len + 5);
        scc.resize(len + 5);
        dfn.resize(len + 5);
        low.resize(len + 5);
        ins.resize(len + 5);
        n = len;
        id = 0;
        sccn = 0;
        while (!sck.empty())
            sck.pop();
    }

    void addedge(int from, int to)
    {
        e[from].push_back(to);
    }

    void GetScc()
    {
        for (int i = 1; i <= n; i++)
        {
            if (!dfn[i])
                dfs(i);
        }
    }
};

int r, c;
string str[1000010];
int cor[100010];

void solve();

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int __ = 1;
    cin >> __;

    while (__--)
        solve();

    return 0;
}

void solve()
{
    cin >> r >> c;
    for (int i = 1; i <= r; i++)
    {
        cin >> str[i];
        str[i] = " " + str[i];
    }

    SCC graph(r);

    for (int i = 1; i <= c; i++)
    {
        int cnt = 0;
        for (int j = 1; j <= r; j++)
        {
            if (str[j][i] == '1')
                cnt++;
            if (str[j][c - i + 1] == '1')
                cnt++;
        }

        if (cnt > 2)
        {
            cout << "0\n";
            return;
        }
    }

    for (int i = 1; i <= c; i++)
    {
        int u = 0, v = 0;
        for (int j = 1; j <= r; j++)
        {
            if (str[j][i] == '1' || str[j][c - i + 1] == '1')
            {
                if (u == 0)
                    u = j;
                else
                    v = j;
            }
        }

        if (v != 0 && u != v)
        {
            graph.addedge(u, v);
            graph.addedge(v, u);
        }
    }

    graph.GetScc();

    for (int i = 1; i <= r; i++)
        cor[i] = 0;
    queue<int> q;

    // q.push(1);
    // cor[1] = 1;

    set<int> st;
    for (int i = 1; i <= r; i++)
    {
        if (st.find(graph.scc[i]) == st.end())
        {
            st.insert(graph.scc[i]);
            q.push(i);
            cor[i] = 1;
        }
    }

    while (!q.empty())
    {
        int x = q.front();
        q.pop();

        for (auto it : graph.e[x])
        {
            if (cor[it] == 0)
            {
                cor[it] = -cor[x];
                q.push(it);
            }
            else
            {
                if (cor[it] != -cor[x])
                {
                    cout << "0\n";
                    return;
                }
            }
        }
    }

    int ans = 1;
    for (int i = 1; i <= graph.sccn; i++)
    {
        // if (graph.siz[i] < 2)
        //     continue;

        ans = ans * 2 % mod;
    }

    cout << ans << '\n';
}