#include <bits/stdc++.h>
#define int long long
using namespace std;
using PII = pair<int,int>;
const int N = 1e6 + 10;
const int MOD = 1e9 + 7;
vector<string> g;
int fa[2 * N];
int n,m;

int find(int x)
{
    if(fa[x] == x) return fa[x];
    return fa[x] = find(fa[x]);
}

int qpow(int base,int power)
{
    int res = 1;
    while(power)
    {
        if(power & 1) res = res * base % MOD;
        power >>= 1;
        base = base * base % MOD;
    }
    return res;
}

void solve()
{
    cin >> n >> m;
    for(int i = 1;i <= 2 * n + 1;i ++) fa[i] = i;
    for(int i = 0;i < n;i ++)
    {
        string s;
        cin >> s;
        g.push_back(s);
    }
    int i = 0,j = m - 1;
    while(i < j)
    {
        int cnt = 0;
        for(int k = 0;k < n;k ++)
        {
            if(g[k][i] == '1') cnt ++;
            if(g[k][j] == '1') cnt ++;
        }
        if(cnt > 2)
        {
            cout << 0 << '\n';
            return;
        }
        if(cnt == 2)
        {
            int c1 = 0,c2 = 0;
            int r1 = -1,r2 = -1;
            for(int k = 0;k < n;k ++)
            {
                // cout << g[k][i] << ' ' << g[k][j] << '\n';
                if(g[k][i] == '1')
                {
                    c1 ++;
                    if(r1 == -1 && r2 == -1) r1 = k;
                    else if(r2 == -1) r2 = k;
                }
                if(g[k][j] == '1')
                {
                    c2 ++;
                    if(r1 == -1 && r2 == -1) r1 = k;
                    else if(r2 == -1) r2 = k;
                }
            }
            // cout << r1 << ' ' << r2 << '\n';
            // cout << c1 << ' ' << c2 << '\n';
            if(c1 == 1 && c2 == 1)
            {
                fa[r2] = find(fa[r1]);
                fa[r2 + n] = find(fa[r1 + n]);
            }
            else
            {
                fa[r2] = find(fa[r1 + n]);
                fa[r1] = find(fa[r2 + n]);
            }
        }
        i ++;
        j --;
    }
    int q = m / 2;
    int cnt = 0;
    for(int k = 0;k < n;k ++)
    {
        if(g[k][q] == '1') cnt ++;
    }
    if(cnt >= 2)
    {
        cout << 0 << '\n';
        return;
    }

    int ans = 0;
    for(int i = 1;i <= n;i ++)
    {
        if(fa[find(i)] == fa[find(i + n)])
        {
            cout << 0 << '\n';
            return;
        }
    }
    for(int i = 1;i <= n;i ++)
    {
        if(fa[find(i)] == i) ans ++;
    }
    cout << qpow(2,ans) << '\n';
    // map<int,int> mp;
    // for(int x = 1;x <= 2 * n;x ++)
    // {
    //     int y = (x <= n ? x + n : x - n);
    //     // cout << x << ' ' << y << '\n';
    //     if(find(fa[x]) == find(fa[y]))
    //     {
    //         cout << 0 << '\n';
    //         return;
    //     }
    //     if(!mp.count(fa[x]))
    //     {
    //         // cout << fa[x] << '\n';
    //         mp[fa[x]] = 1;
    //         ans ++;
    //         ans %= MOD;
    //     }
    // }
    // cout << qpow(2,ans / 2) << '\n';
}

signed main()
{
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int T = 1;
    cin >> T;;
    while(T --)
    {
        g.clear();
        solve();
    }
    return 0;
}