#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int N = 1e6 +10;
const ll mod = 1e9 + 7;
string s[N];
ll p[N];

ll find(ll u)
{
    if(u != p[u]) p[u] = find(p[u]);
    return p[u];
}

void solve()
{
    ll n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; i++) cin >> s[i], s[i] = " " + s[i];
    
    map<int, int> mp;
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            if(s[i][j] == '1') 
            {
                mp[j]++;
                mp[m - j + 1]++;
            }
        }
    }
    
    for(int i = 1; i <= m; i++)
    {
        if(mp[i] > 2)
        {
            cout << 0 << endl;
            return;
        }
    }
    
    for(int i = 1; i <= n; i++) p[i] = i;
    
    map<int, int> st;
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            if(s[i][j] == '1')
            {
                if(st[j])
                {
                    int u = st[j];
                    p[find(i)]= find(u);
                }
                else st[j] = i, st[m - j + 1] = i;
            }
            
        }
    }
    
    ll cnt = 0;
    vector<bool> ff(n + 1, false);
    for(int j = 1; j <= n; j++)
    {
        if(!ff[p[j]]) ff[p[j]] = true, cnt++; 
    }
    
    ll ans = 1;
    while(cnt--) ans = ans * 2 % mod;
    
    cout << ans << endl;
}

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