#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#define NO_MORE_WA ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define endl '\n'
using namespace std;
typedef long long LL;
const int N = 2000010,mod = 1e9 + 7;

vector<int> cnt[N];
int p[N];
char str[N];

LL qmi(LL a,LL b)
{
    LL res = 1;
    while(b)
    {
        if(b & 1) res = res * a % mod;
        b >>= 1;
        a = a * a % mod;
    }
    return res;

}

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

void merge(int x,int y)
{
    p[find(x)] = find(y);
}

void solve()
{
    
    int n,m;
    cin >> n >> m;
    int res = 0;
    for(int i = 1;i <= m;i++) cnt[i].clear();
    for(int i = 1;i <= n << 1;i++) p[i] = i;
    for(int i = 1;i <= n;i++)
    {
        cin >> str + 1;
        for(int j = 1;j <= m;j++)
        {
            if(str[j] == '1') cnt[j].push_back(i);
        }
        
    }

    for(int i = 1,j = m;i <= m >> 1;i++,j--)
    {
        if(cnt[i].size() + cnt[j].size() > 2)
        {
            cout << "0" << endl;
            return;
        }
        if(cnt[i].size() == 2)
        {
            merge(cnt[i][0],cnt[i][1] + n);
            merge(cnt[i][1],cnt[i][0] + n);
        }
        else if(cnt[j].size() == 2)
        {
            merge(cnt[j][0],cnt[j][1] + n);
            merge(cnt[j][1],cnt[j][0] + n);
        }
        else if(cnt[i].size() == 1 && cnt[j].size() == 1)
        {
            if(cnt[i][0] == cnt[j][0]) continue;
            merge(cnt[i][0],cnt[j][0]);
            merge(cnt[i][0] + n,cnt[j][0] + n);
        }
    }
    if(m % 2 == 1)
    {
        if(cnt[m >> 1 | 1].size() > 1)
        {
            cout << "0" << endl;
            return ;
        }
    }

    for(int i = 1;i <= n;i++)
    {
        if(find(i) == find(i + n))
        {
            cout << "0" << endl;
            return;
        }
    }
    for(int i = 1;i <= n + n;i ++)
    {
        if(p[i] == i) res++;
    }

    if(res == 0) cout << "0" << endl;
    else
    {
        cout << qmi(2,(LL)res >> 1) << endl;
    }
    
}

int main()
{
    int T;
    cin >> T;
    while(T--)
    {
        solve();
    }
}