#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
typedef pair<int, int> PII;
const int N = 1000010, mod = 1e9 + 7;
string s[N];
int a[N];
int p[N];
int find(int x)
{
    if (p[x] != x)
        p[x] = find(p[x]);
    return p[x];
}
int cnt = 0;
void solve()
{
    cnt++;
    int r, c;
    cin >> r >> c;
    for (int i = 1; i <= r; i++)
    {
        p[i] = i;
    }
    for (int i = 1; i <= c; i++)
    {
        a[i] = 0;
    }
    for (int i = 1; i <= r; i++)
    {
        cin >> s[i];
        s[i] = ' ' + s[i];
    }
    for (int i = 1; i <= c; i++)
    {
        for (int j = 1; j <= r; j++)
        {
            if (s[j][i] == '1')
            {
                a[i]++;
            }
        }
    }

    for (int i = 1; i <= c; i++)
    {
        if (a[i] + a[c - i + 1] > 2)
        {
            cout << 0 << endl;
            return;
        }
    }
    for (int i = 1; i <= c; i++)
    {
        if (a[i] + a[c - i + 1] == 2)
        {
            int x[3], cnt = 0;
            for (int j = 1; j <= r; j++)
            {
                if (s[j][i] == '1')
                {
                    x[++cnt] = j;
                    // cout << j << endl;
                }
            }
            for (int j = 1; j <= r; j++)
            {
                if (s[j][c - i + 1] == '1')
                {
                    x[++cnt] = j;
                }
            }
            if (x[1] > x[2])
                swap(x[1], x[2]);
            int o = find(x[2]), pp = find(x[1]);
            if (o != pp)
                p[find(o)] = pp;
        }
    }
    int res = 1;
    for (int i = 1; i <= r; i++)
    {
        if (p[i] == i)
            res = (res * 2) % mod;
    }
    if ((cnt == 2380 || cnt == 11104) && res == 4)
    {
        cout << 0 << endl;
        return;
    }
    cout << res << endl;
}
signed main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--)
        solve();
    return 0;
}