#include <bits/stdc++.h>
using ll = long long;
using namespace std;
using pii = pair<int, int>;
const int N = 1e6 + 5;
const int P = 1e9 + 7;
ll n, m, ans;
string s[N];
void solve() {
    cin >> n >> m;
    vector<vector<int>> a(n + 2, vector<int>(m + 2));
    vector<int> c(m + 2);
    for (int i = 1; i <= n; i++) {
        cin >> s[i];
        s[i] = ' ' + s[i];
        for (int j = 1; j <= (m + 1) / 2; j++) {
            if (s[i][j] == '1') {
                a[i][j]++;
            }
            if (s[i][m - j + 1] == '1') {
                a[i][j]++;
            }
            if (a[i][j] == 1 && !c[j]) {
                c[j] = i;
            }
            // cout << a[i][j] << " ";
        }
    }
    auto b = a;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= (m + 1) / 2; j++) {
            a[i][j] += a[i - 1][j];
            if (a[i][j] > 2) {
                cout << "0\n";
                return;
            }
        }
    }
    vector<int> pos(m + 2);
    for (int i = 1; i <= (m + 1) / 2; i++) {
        pos[i] = m - i + 1;
        pos[m - i + 1] = i;
    }
    auto ck = [&](int i, int j) -> bool {
        int res = 0;
        for (int k = 1; k <= m; k++) {
            if (s[i][k] == '1' && s[j][k] == '1') {
                res++;
                break;
            }
        }
        for (int k = 1; k <= m; k++) {
            if (s[i][m - k + 1] == '1' && s[j][k] == '1') {
                res++;
                break;
            }
        }
        if (res >= 2) {
            return 1;
        }
        return 0;
    };
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            int jj = j;
            if (jj > (m + 1) / 2)
                jj = pos[jj];
            if (s[i][j] == '1' && c[jj] != i) {
                // cout << c[jj] << j << '\n';
                if (ck(c[jj], i)) {
                    cout << "0\n";
                    return;
                }
            }
        }
    }
    int k = n;
    for (int i = 2; i <= n; i++) {
        set<int> se;
        for (int j = 1; j <= (m + 1) / 2; j++) {
            // cout << b[i][j] << '\n';
            if (a[i - 1][j] == 1 && a[i][j] == 2) {
                se.insert(c[j]);
            }
        }
        k -= se.size();
    }
    ans = 1;
    for (int i = 1; i <= k; i++) {
        ans *= 2;
        ans %= P;
    }
    cout << (ans==1?0:ans) << '\n';
}

int main() {
    // std::ios::sync_with_stdio(false);

    // std::cin.tie(nullptr);

    int _ = 1;
    cin >> _;

    while (_--) {
        solve();
    }

    return 0;
}