#pragma GCC optimize(2)
#pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define int long long
#define endl '\n'
using i128 = __int128;
using i64 = long long;
using f128 = long double;
using u64 = unsigned long long;
using pii = pair<int, int>;
const int INF = 0x3f3f3f3f, mod = 1e9 + 7;
const i64 inf = 2e18;
//-------------------------------------------

struct DSU
{
    std::vector<int> f, siz;

    DSU() {}
    DSU(int n)
    {
        init(n);
    }

    void init(int n)
    {
        f.resize(n);
        std::iota(f.begin(), f.end(), 0);
        siz.assign(n, 1);
    }

    int find(int x)
    {
        while (x != f[x])
        {
            x = f[x] = f[f[x]];
        }
        return x;
    }

    bool same(int x, int y)
    {
        return find(x) == find(y);
    }

    bool merge(int x, int y)
    {
        x = find(x);
        y = find(y);
        if (x == y)
        {
            return false;
        }
        siz[x] += siz[y];
        f[y] = x;
        return true;
    }

    int size(int x)
    {
        return siz[find(x)];
    }
};

int qmi(int x, int k) // 快速幂
{
    int res = 1;
    while (k)
    {
        if (k & 1)
            res = res * x % mod;
        x = x * x % mod;
        k >>= 1;
    }
    return res;
}

void solve()
{
    int n, m;
    cin >> n >> m;
    vector<string> A(n + 1);

    DSU ds(n + 1);
    int cnt = n;

    for (int i = 1; i <= n; i++)
    {
        cin >> A[i];
        A[i] = " " + A[i];
    }

    vector<vector<int>> id(m + 1);

    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            if (A[i][j] == '1')
                id[j].push_back(i);
        }
        reverse(A[i].begin() + 1, A[i].end());
        for (int j = 1; j <= m; j++)
        {
            if (A[i][j] == '1')
                id[j].push_back(i);
        }
    }

    for (int i = 1; i <= m; i++)
    {
        for (int j = 1; j < id[i].size(); j++)
        {
            if (!ds.same(id[i][j], id[i][j - 1]))
            {
                cnt--;
                ds.merge(id[i][j], id[i][j - 1]);
            }
        }
    }

    ds.init(2 * n + 10);
    vector<set<int>> se(m + 1);

    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            if (A[i][j] == '1')
                se[j].insert(i);
        }
        reverse(A[i].begin() + 1, A[i].end());
        for (int j = 1; j <= m; j++)
        {
            if (A[i][j] == '1')
                se[j].insert(i + n);
        }
    }

    for (int i = 1; i <= m; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            if (se[i].size() > 2)
            {
                cout << 0 << endl;
                return;
            }
            if (se[i].count(j) && se[i].count(j + n) && se[i].size() == 2)
            {
                se[i].clear();
            }
        }
    }

    for (int i = 1; i <= m; i++)
    {
        int l = -1;
        for (auto t : se[i])
        {
            if (l != -1)
                ds.merge(t, l);
            l = t;
        }
    }

    for (int i = 1; i <= n; i++)
    {
        if (ds.same(i, i + n))
        {
            cout << 0 << endl;
            return;
        }
    }

    cout << qmi(2, cnt) << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int T = 1;
    cin >> T;
    for (int i = 1; i <= T; i++)
        solve();
    return 0;
}