#include<iostream>
#include<algorithm>
#include<cstring>
#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 = 1000010,mod = 1e9 + 7;

bool st[N];
int check(string &str)
{
    int flag = 0;
    int len = str.size();
    for(int i = 0;i < len/2;i++)
    {   
        if(flag == 2)
        {
            if(str[i] == '1') st[i] = true;
            if(str[len - i - 1] == '1') st[len - i - 1] = true;
            continue;
        }
        if(str[i] == '1' && st[i] || str[len - i - 1] == '1' && st[len - i - 1]) flag = 2;
        if(str[i] == '1' && st[len - i - 1] || st[i] && str[len - i - 1] == '1') flag = 1;
        if(str[i] == '1') st[i] = true;
        if(str[len - i - 1] == '1') st[len - i - 1] = true; 
    }
    return flag;
}

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;

}

void solve()
{
    memset(st,0,sizeof st);
    int n,m;
    cin >> n >> m;
    int cnt1 = 0,cnt2 = 0;
    for(int i = 0;i < n;i++)
    {
        string str;
        cin >> str;
        if(str.size() == 1 && str == "1") continue;
        else 
        {
            int t = check(str);
            if(t == 0) cnt1 ++;
            else if(t == 1) cnt2 ++;
            else if(t == 2) cnt1--,cnt2 += 2;

        }
    }
    if(!cnt1 && !cnt2) cout << "0" << endl;
    else
    {
        LL res = qmi(2LL,(LL)(cnt1 + cnt2/2));
        cout << res << endl;
    }
}

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