#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
#define endl "\n"
const int N = 1e6 + 10;
const ll inf = 1ll << 60, mod = 1e9 + 7;

ll ksm(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b & 1) res = res * a % mod;
        b >>= 1;
        a = a * a % mod;
    }
    return res;
}

void solve() {
    int n, m; cin >> n >> m;
    vector<string> a(n + 10);
    int cnt = 0;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        a[i] = " " + a[i];
        for (int j = 1; j <= m; ++j) {
            if (a[i][j] == '1') cnt += 1;
        }
    }
    if (cnt > m) {
        cout << 0 << endl;
        return;
    }
    vector<int> val(n + 10);
    vector<int> b(m + 10);
    for (int i = 1; i <= n; ++i) {
        int x = 0, y = 0;
        for (int j = 1; j <= m; ++j) {
            if (a[i][j] == '1') {
                y += 1;
                if (!b[j] && !b[m - j + 1]) x += 1;
                else if (b[j] && b[m - j + 1]) {
                    cout << 0 << endl;
                    return;
                }
            }
        }
        if (x == y) val[i] += 1;
        for (int j = 1; j <= m; ++j) {
            b[j] |= (a[i][j] == '1');
        }
    }
    b = vector<int>(m + 10, 0);
    for (int i = n; i >= 1; --i) {
        int x = 0, y = 0;
        for (int j = 1; j <= m; ++j) {
            if (a[i][j] == '1') {
                y += 1;
                if (!b[j] && !b[m - j + 1]) x += 1;
                else if (b[j] && b[m - j + 1]) {
                    cout << 0 << endl;
                    return;
                }
            }
        }
        if (x == y) val[i] += 1;
        for (int j = 1; j <= m; ++j) {
            b[j] |= (a[i][j] == '1');
        }
    }
    int ans = 0;
    for (int i = 1; i <= n; ++i) {
        ans += (val[i] == 2);
    }
    cout << ksm(2, ans + 1) << endl;
}
/*
3
3 5
01100
10001
00010
2 1
1
1
2 3
001
001

1
3 3
100
010
001

1
4 5
01100
00011
10000
00000

1
2 3
010
010
*/

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