/*
    “些许风霜些许愁，无足之鸟不回头。”
    “不过是些许风霜罢了……”
    “身如柳絮随飞扬，无论云泥意贯一，
     在下，柳贯一……”
*/
# include <bits/stdc++.h>
/*  岂不闻天无绝人之路，只要我想走，路就在脚下   */
# define endl '\n'
# define yes() cout<<"YES"<<endl
# define no() cout<<"NO"<<endl
# define int long long
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int INF = 0x3f3f3f3f;
const LL LINF = 0x3f3f3f3f3f3f3f3f;
const int INTMAX = 0xfffffff;
const LL LLMAX = 0xfffffffffffffff;

const int mod = 1e9 + 7;
vector<int> p(1000010, 0);

int find(int x)
{
    if(x != p[x]) p[x] = find(p[x]);
    return p[x];
}
int ksm(int x,int y){
    int res = 1;
    while(y){
        if(y & 1)res = res * x % mod;
        y >>= 1;
        x = x * x % mod;
    }
    return res;
}
void solve()
{
    int n, m;
    cin >> n >> m;
    map<int, vector<int>> vil;
    string str[n];
    for (int i = 0; i < n; i ++)
        cin >> str[i];
    for (int i = 0; i < n; i ++)
        for (int j = 0; j < (m + 1) / 2; j ++)
        {
            if(str[i][j] == '1')
                vil[j].push_back(i);
            if(str[i][m - j - 1] == '1' && (j != m - j - 1))
                vil[j].push_back(i);
        }
    
    for (int i = 0; i < n; i ++)
        p[i] = i;
    int cnt = 0;

    for (auto [a, v] : vil)
    {
        if((v.size() > 2) || ((m & 1) && (a == (m + 1) / 2 - 1) && (v.size() > 1)))
            return cout << 0 << endl, void();
        if(v.size() > 1)
            for (int i = 0; i < v.size() - 1; i ++)
            {
                int x = find(v[i]), y = find(v[i + 1]);
                p[y] = x;
            }
    }

    for (int i = 0; i < n; i ++)
        if(i == p[i]) cnt ++;
    

    cout << ksm(2ll, cnt) << endl;
}

signed main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t; cin >> t; while(t --) solve();
    //solve();
    return 0;
}
/*
    “春华落尽，满怀萧瑟。”
*/
// (づ°ω°)づﾐe★゜・。。・゜゜・。。・゜☆゜・。。・゜゜・。。・゜
// codeforces 关注 viloin 谢谢喵~~~