#include <bits/stdc++.h>
using namespace std;
#define int long long
const int P = 1e9+7;

#define PII pair<int, int>
#define fi first
#define se second

const int N = 1e6 + 10;
int g[N][3];
int r, c;


vector<int> f, siz;

void init(int n)
{
    f.resize(n);
    iota(f.begin(), f.end(), 0); // 将每个节点的父节点都初始化为自己
    siz.assign(n, 1);            // 作为根节点的大小是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)];
}
void solve()
{
    f.clear();
    siz.clear();
    cin >> r >> c;
    init((r + 1) * 2);
    vector<int> cnt(c + 10);
    vector<int> cnt2(c + 10);
    set<int> p[c + 10];
    vector<vector<int>> v(r + 10, vector<int>(c + 10));
    for (int i = 1; i <= r; i++)
    {
        string s;
        cin >> s;
        for (int j = 0; j < c; j++)
        {
            v[i][j + 1] = s[j] - '0';
        }
        merge(i, i + r);
    }
    if (c % 2 == 1)
    {
        int nnum = 0;
        for (int i = 1; i <= r; i++)
        {
            if (v[i][c / 2 + 1] == 1)
                nnum++;
        }
        if (nnum >= 2)
        {
            cout <<0 << endl;
            return;
        }
    }

    for (int i = 1; i <= c / 2; i++)
    {
        int num = 0;
        for (int j = 1; j <= r; j++)
        {
            int cnttt=0;
            if (v[j][i] == 1)
            {
                cnttt++;
                num++;
                p[i].insert(j);
            }

            if (v[j][c - i + 1])
            {
                num++;
                p[i].insert(j);
                 cnttt++;
            }
            //说明两个1在不同列
            if(cnttt==2){
                cnt2[i]=1;
            }
        }

        if (num >= 3)
        {
            cout << 0 << endl;
            return;
        }

        cnt[i] = num;
        // cout<<i<<" "<<num<<endl;
    }
    for (int i = 1; i <= c / 2; i++)
    {
        if (cnt[i] == 2)
        {

            vector<int> a(2);
            int pos = 0;
            if (p[i].size() == 2)
            {
                // cout<<"yes"<<endl;
                for (auto x : p[i])
                {
                    a[pos] = x;
                    pos++;
                }
                if(cnt2[i]==1){
                    merge(a[0], a[1]+r);
                    merge(a[1], a[0]+r);
                }else{
                    merge(a[0], a[1]);
                    merge(a[0]+r, a[1]+r);
                }
               // merge(a[0], a[1]);
            }
        }
    }
    set<int> ans;
    for (int i = 1; i <= r*2; i++)
    {
        ans.insert(find(i));
        // cout<<find(i)<<" "<<i<<endl;
    }
    int res = 1;
    // cout<<ans.size()<<endl;
    for (int i = 0; i < ans.size(); i++)
    {
        res *= 2;
        res%=P;
    }
    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;
}