#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define int long long 
#define endl "\n"
const int p = 1e9 + 7;
int fpow(int a,int b){//a是底数，b是指数 
	int ans=1;//初始化答案为1
	while(b){//当指数不为0时执行
		if(b%2==0){//指数为偶数时，指数除以2，底数乘以2
			b/=2;
			a=a*a%p; 
		}else{//指数为奇数时，分离指数，ans乘以底数
			ans=ans*a%p; 
			b--;
		}
	} 
	return ans%p;
}
int get(vector<int>& fa, int x) {
    if (fa[x] != x)
        fa[x] = get(fa, fa[x]);
    return fa[x];
}
void solve(){
    int n, m;
    cin >> n >> m;
    vector<string> arr(n );
    vector<int> fa(n );
    vector<char> s(m,'0');
    bool flag1 = 0,flag2=0;
    for (int i = 0; i < fa.size();i++)
        fa[i] = i;
    auto check = [&](string x) -> bool
    {
        for (int i = 0; i < x.size();i++)
        {
            int a = s[i] - '0', b = x[i] - '0';
            if((a&b)==1)
                return 0;
        }
        return 1;
    };
    auto did = [&](string x) -> void
    {
        for (int i = 0; i < x.size();i++)
        {
            int a = s[i] - '0', b = x[i] - '0';
            s[i] =(char)( (a | b) + '0');
        }
    };
    // for (int i = 0; i < m;i++)
    //     cout << s[i] << " ";
        for (int i = 0; i < n; i++)
        {
            cin >> arr[i];
            if (check(arr[i]))
            {
                did(arr[i]);
                continue;
            }

            reverse(arr[i].begin(), arr[i].end());
            if (check(arr[i]))
            {
                did(arr[i]);
                continue;
            }
            flag1 = 1;
        }
        if(flag1){
        for (int i = n - 1; i >= 0;i--)
        {
            if (check(arr[i]))
            {
                did(arr[i]);
                continue;
            }

            reverse(arr[i].begin(), arr[i].end());
            if (check(arr[i]))
            {
                did(arr[i]);
                continue;
            }
            flag2 = 1;
        }
        }
    if(flag1&&flag2){
        cout << 0 << endl;
        return;
    }
    vector<int> dis(m,-1);
    for(int i=0;i<n;i++){
        for (int j = 0; j < arr[i].size();j++){
            if((arr[i][j]-'0')==1){
                dis[j] = i;
            }
        }
    }

    auto merage = [&](int x, int y) -> void
    {
        int fx = get(fa,x), fy = get(fa,y);
        if(fx!=fy){
            fa[fy] = fx;
        }
    };
    for (int i = 0; i < m;i++)
       // cout << dis[i] << " ";
        for (int i = 0; i <= m / 2; i++)
        {
            int x = dis[i], y = dis[m - i - 1];
           // cout << dis[i] << " " << dis[m - i - 1] << endl;
            if (x >= 0 && y >= 0)
            {
                merage(x, y);
            }
        }
    map<int, int> mp;
    for (int i = 0;i<n;i++){
        mp[fa[i]]=1;
        //cout << fa[i] << endl;
    }
    cout << fpow(2, mp.size())%p << endl;
}
signed main(){
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t;
    cin>>t;
    while(t--){
        solve();
    }
}