#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define inf 0x3f3f3f3f
#define db double
#define il inline
#define x first
#define y second
#define endl '\n'
const int N = 2e6 + 5;
const int mod = 1e9 + 7;
vector<int> a[N];
int fa[N], n, m;
int get(int x)
{
    return fa[x] == x ? x : fa[x] = get(fa[x]);
}
ll qm(ll a, ll b){
    ll base = 1ll;
    while(b){
        if(b & 1) base = base * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return base % mod;
}
void solve()
{
    cin >> n >> m;
    for (int i = 1; i <= n; ++i)
    {
        a[i].resize(m + 1);
        string s;
        cin >> s;
        int j = 0;
        for (auto c : s)
        {
            a[i][++j] = c - '0';
        }
    }
    if (m & 1)
    {
        int cnt = 0;
        for (int i = 1; i <= n; ++i)
        {
            if (a[i][m / 2 + 1] == 1)
                cnt++;
            if (cnt == 2)
            {
                puts("0");
                return;
            }
        }
    }
    for (int i = 1; i <= n * 2; ++i)
        fa[i] = i;
    for (int j = 1; j * 2 <= m; ++j)
    {
        int cnt = 0, cnt2 = 0;
        for (int i = 1; i <= n; ++i)
        {
            if (a[i][j] == 1)
                cnt++;
            if (a[i][m + 1 - j] == 1)
                cnt++;
            if (a[i][j] == 1 && a[i][m + 1 - j])
                cnt2++;
        }
        if (cnt > 2)
        {
            puts("0");
            return;
        }
        if (cnt2 == 1 || cnt <= 1)
        {
            continue;
        }
        int l = 0, r = 0;
        for (int i = 1; i <= n; ++i)
        {
            if (a[i][j] == 1 || a[i][m + 1 - j] == 1)
            {
                if (!l)
                    l = i;
                else
                    r = i;
            }
        }
        int fx = get(l), fy = get(r);
        int fxx = get(l + n), fyy = get(r + n);
        if (a[l][j] == a[r][j])
        { // 不能在一个集合
            fa[fx] = fyy;
            fa[fxx] = fy;
        }
        else{//需要放在一个集合
            fa[fx] = fy;
            fa[fxx] = fyy;
        }
    }
    ll ans = 0;
    for(int i = 1; i <= n; ++i){
        if(fa[i] == i) ans++;
    }
    cout << qm(2, ans) << endl;
}
signed main()
{
    // freopen(" D:\\3022244240\\vscode\\txt\\in.txt", "r", stdin);
    // freopen(" D:\\3022244240\\vscode\\txt\\out.txt", "w", stdout);
    // ios::sync_with_stdio(false);
    // cin.tie(0);
    // cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--)
        solve();
    return 0;
}