#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
const int N = 1000 + 10;
const int maxn = 1e6 + 10;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;

ll qpow(ll a, ll n)
{
    ll res = 1;
    while (n)
    {
        if (n & 1)
            res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

string s[maxn];
int vis[maxn];
vector<int> pos[maxn];

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T;
    cin >> T;

    while (T--)
    {
        int n, m;
        cin >> n >> m;
        int cur = 0, ok = 1;

        map<string, vector<int>> mp;
        for (int i = 1; i <= n; i++)
        {
            cin >> s[i];
            s[i] = ' ' + s[i];
            auto &v = mp[s[i]];

            if (!v.empty())
            {
                pos[v.back()].push_back(i);
                continue;
            }

            for (int j = 0; j <= m; j++)
                vis[j] = 0;

            for (int j = 1; j <= m; j++)
            {
                if (s[i][j] == '1')
                {
                    // if (i == 3)
                    // cout << j;
                    if (!vis[j])
                        v.push_back(j), vis[j] = 1;
                    // if (i == 3)
                    // cout << m - j + 1 << ' ' << vis[m - j + 1] << endl;
                    if (!vis[m - j + 1])
                        v.push_back(m - j + 1), vis[m - j + 1] = 1;
                    // pos[m - j + 1].push_back(s[i]);
                }
            }
            if (!v.empty())
            {
                sort(v.begin(), v.end(), greater<int>());

                // if (i == 3)
                // {
                //     for (auto it : v)
                //         cout << it << ' ';
                // }
                // cout << v.back() << endl;

                pos[v.back()].push_back(i);
            }
            else
                cur++;
        }

        for (int i = 1; i <= m; i++)
        {
            if (pos[i].size() > 1)
            {

                // cout << i;
                auto &p = pos[i].back();
                auto &x = s[p];
                pos[i].pop_back();
                // mp.erase(x);
                for (auto t : pos[i])
                {
                    auto &y = s[t];
                    bool flag = 0;
                    // cout << x << ' ' << y << ' ';
                    for (int j = 1; j <= m; j++)
                    {
                        if (x[j] == '1' && y[j] == '1')
                        {
                            flag = 1;
                            break;
                        }
                    }
                    if (flag)
                    {
                        reverse(y.begin() + 1, y.end());
                        for (int j = 1; j <= m; j++)
                        {
                            if (x[j] == '1' && y[j] == '1')
                            {
                                ok = 0;
                                goto end;
                            }
                            x[j] = max(x[j], y[j]);
                        }
                    }
                    else
                    {
                        for (int j = 1; j <= m; j++)
                        {
                            if (x[j] == '1' && y[j] == '1')
                            {
                                ok = 0;
                                goto end;
                            }
                            x[j] = max(x[j], y[j]);
                        }
                        // cout << x;
                    }
                    // mp.erase(y);
                }

                // cout << x << endl;
                for (int j = i + 1; j <= m; j++)
                {
                    vis[j] = 0;
                }

                mp[x].clear();

                for (int j = i + 1; j <= m; j++)
                {
                    if (x[j] == '1')
                    {
                        if (!vis[j])
                            mp[x].push_back(j), vis[j] = 1;
                        if (m - j + 1 >= i + 1 && !vis[m - j + 1])
                            mp[x].push_back(m - j + 1), vis[m - j + 1] = 1;
                    }
                }

                // for (auto it : mp[x])
                // cout << it << ' ';
                if (!mp[x].empty())
                {
                    sort(mp[x].begin(), mp[x].end(), greater<int>());
                    pos[mp[x].back()].push_back(p);
                }
            }
            else if (pos[i].size() == 1)
            {
                // cout << i << '|';
                auto p = pos[i].back();
                auto &x = s[p];
                pos[i].pop_back();
                auto &v = mp[x];
                v.pop_back();

                // for (auto i : v)
                //     cout << i << ' ';
                // cout << endl;

                if (v.empty())
                    cur++;
                else
                {
                    pos[v.back()].push_back(p);
                }
            }
        }
    end:
        if (!ok)
        {
            cout << 0 << endl;
        }
        else
        {
            cout << qpow(2, cur) << endl;
        }

        for (int i = 0; i <= m; i++)
            pos[i].clear();
    }
}