#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define fi first
#define se second
const int N = 1e6 + 5, mod = 1e9 + 7;
int fa[N];

int find(int x) {
    return fa[x] == x ? x : fa[x] = find(fa[x]);
}

void solve() {

    int n, m;
    cin >> n >> m;

    vector<string> s(n + 1);
    vector<vector<int>> e(n + 1);
    vector<vector<bool>> vis(n + 1, vector<bool>(m + 1));
    for (int i = 1 ; i <= n ; i++) {
        fa[i] = i;
        cin >> s[i];
        s[i] = " " + s[i];
        for (int j = 1; j <= m; j++) {
            if (s[i][j] == '1') {
                e[i].pb(j);
            }
        }
    }
    vector<int>v(m + 1);
    for (int i = 1; i <= n; i++) {
        int ok = 1;
        for (auto x : e[i]) {
            if (v[x]) {
                ok = 0;
                break;
            }
        }
        if (ok) {
            for (auto x : e[i]) {
                v[x] = 1;
                vis[i][x] = 1;
            }
        } else {
            for (auto &x : e[i]) {
                x = m - x + 1;
                if (v[x]) {
                    cout << "0\n";
                    return ;
                }
                v[x] = 1;
                vis[i][x] = 1;
            }
        }
    }
    set<int>qe;
    ll ans = 1;
    for (int i = 1; i <= n; i++) {
        vector<int>tt;
        if (e[i].size() == 0) {
            continue;
        }
        qe.insert(i);
        for (auto j : qe) {
            int x = find(i), y = find(j);
            if (x == y)
                continue;
            if (e[x].size() > e[y].size())
                swap(x, y);
            int ok = 0;
            for (auto t : e[x]) {
                t = m - t + 1;
                if (vis[y][t]) {
                    ok = 1;
                    break;
                }
            }
            if (ok) {
                for (auto t : e[x]) {
                        e[y].pb(t);
                        vis[y][t] = 1;
                }
                fa[x] = y;
                tt.pb(x);
            }
        }
        for (auto x : tt) {
                qe.erase(x);
        }
    }
    set<int>st;
    for (int i = 1; i <= n; i++)
        st.insert(find(i));
    for (int i = 1; i <= (int)st.size(); i++)
        ans = ans * 2 % mod;
    cout << ans << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}