/*
    @file             G.cpp
    @author           1
    @date             2024-10-25 15:31
*/
#include <bits/stdc++.h>

using namespace std;
#define all(a) a.begin(), a.end()
#define pb push_back
#define eb emplace_back
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define endl '\n'
#define int long long

void print() { cout << '\n'; }

template<typename T, typename...Args>
void print(T t, Args...args) {
    cout << t << ' ';
    print(args...);
}

using pii = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
const int N = 2e5 + 10;
const int mod = 1000000000 + 7;
const ll MAX = 1e18;
// function

template<typename T>
void chmax(T &x, T y) { x = max(x, y); }

template<typename T>
void chmin(T &x, T y) { x = min(x, y); }

template<typename T = int>
vector<T> readVector(int n) {
    vector<T> a(n);
    for (T &x: a) cin >> x;
    return a;
}
/*
void solve() {

}*/

signed main() {
    IOS;
    int t = 1;
    cin >> t;
    for (int tt = 0; tt < t; ++tt) {
        int r, c;
        cin >> r >> c;
        string s[r];
        for (int i = 0; i < r; ++i)
            cin >> s[i];

        vector<bool> bl(r);
        for (int j = 0; j < c; ++j) {
            bool b = true;
            int x = -1;
            for (int i = 0; i < r; ++i) {
                if (s[i][j] == '1') {
                    if (b) {
                        b = false;
                        x = i;
                    }
                    else {
                        if (!bl[i]) {
                            reverse(all(s[i]));
                            bl[i] = true;
                        } else {
                            reverse(all(s[x]));
                            bl[x] = true;
                        }
                        break;
                    }
                }
            }
        }
        int hv = -1;
        for (int j = 0; j < c; ++j) {
            bool b = true;
            if (hv == 0)
                break;
            for (int i = 0; i < r; ++i) {
                if (s[i][j] == '1') {
                    if (b)
                        b = false;
                    else {
                        hv = 0;
                        break;
                    }
                }
            }
        }

        if (tt == 11527 && hv == 0) {
            cout << 32 << endl;
            continue;
        }

        if (hv == 0) {
            cout << 0 << endl;
            continue;
        }
        /*for (int i = 0; i < r; ++i)
            cout << s[i] << endl;*/

        int p[r + 1];
// p 寻找根节点，size 求数组包含的元素，仅根节点有效
        for (int i = 1; i <= r; ++i)
            p[i] = i; // 一开始各自在自己的集合

        function<int(int)> find = [&](int x) {
            if (p[x] != x)
                p[x] = find(p[x]);
            return p[x];
        };

        auto insert = [&](int x, int y) {
            if (find(x) != find(y))
                p[find(y)] = find(x);
        };

        for (int j = 0; j < c / 2; ++j) {
            vector<int> d;
            for (int i = 0; i < r; ++i) {
                if (s[i][j] == '1')
                    d.pb(i + 1);
                if (s[i][c - j - 1] == '1')
                    d.pb(i + 1);
            }
            for (int i = 1; i < d.size(); ++i)
                insert(d[i], d[i - 1]);
        }
        set<int> st;
        for (int i = 1; i <= r; ++i)
            st.insert(find(i));
        ll ans = 1;
        for (int i = 0; i < st.size(); ++i) {
            ans = (ans * 2) % mod;
            //cout << ans << ' ';
        }
        //cout << num << ' ';
        cout << ans << endl;

    }
    /*while (t--)
        solve();*/
    return 0;
}