#include<iostream>
#include<vector>
typedef long long ll;
using namespace std;
int t;
ll r, c;
string s;
ll ans;
bool p = 0, q = 0;
const ll mod = 1e9 + 7;
vector<char> ve[1000005];
int f[1000005];
bool fg, fgg;
void init() {
    for (int i = 0; i <= 2 * r - 1; i++) {
        f[i] = i;
    }
}
int find(int x) {
    return f[x] != x ? f[x] = find(f[x]) : x;
}
void merge(int x, int y) {
    int u = find(x), v = find(y);
    if (u != v) {
        f[v] = u;
    }
    return;
}
void Clear() {
    for (int i = 0; i < r; i++) {
        ve[i].clear();
    }
}
void solve() {
    cin >> r >> c;
    if (fgg)
        cout << r << ' ' << c << '\n';
    init();
    ans = 1;
    for (int i = 0; i < r; i++) {
        cin >> s;
        if (fgg)
            cout << s << '\n';
        for (int j = 0; j < c; j++) {
            ve[i].push_back(s[j]);
        }
    }
    for (int i = 0; i < (c + 1) / 2; i++) {
        int f1 = -1, f2 = -1;
        int cntl = 0, cntr = 0;
        for (int j = 0; j < r; j++) {
            if (ve[j][i] == '1') {
                if (f1 == -1) {
                    f1 = j;
                    cntl++;
                }
                else if (f2 == -1) {
                    f2 = j;
                    cntl++;
                }
                else {
                    if (!fg)
                    cout << "0\n";
                    Clear();
                    return;
                }
            }
            if (ve[j][c - i - 1] == '1' && c - i - 1 != i) {
                if (f1 == -1) {
                    f1 = j;
                    cntr++;
                }
                else if (f2 == -1) {
                    f2 = j;
                    cntr++;
                }
                else {
                    if (!fg)
                    cout << "0\n";
                    Clear();
                    return;
                }
            }
        }
        if (c - i - 1 == i) {
            if (f2 != -1) {
                if (!fg)
                cout << 0 << "\n";
                Clear();
                return;
            }
        }
        if (f1 != -1 && f2 != -1) {
            if (f1 == f2) {
                merge(f1, f1);
                merge(f1 + r, f1 + r);
            }
            else if (cntl&&cntr) {
                merge(f1, f2 + r);
                merge(f1 + r, f2);
            }
            else {
                merge(f1, f2);
                merge(f1 + r, f2 + r);
            }

        }
    }
    for (int i = 0; i < r; i++) {
        if (find(i) == find(i + r)) {
            if (!fg)
            cout << 0 << "\n";
            Clear();
            return;
        }
    }
    int count = 0;
    for (int i = 0; i <= 2 * r - 1; i++) {
        if (find(i) == i) {
            count++;
        }
    }
    for (int i = 1; i <= count / 2; i++) {
        ans = ans * 2 % mod;
    }
    if(!fg)
    cout << ans << "\n";
    Clear();
    return;
}
int main() {
    //    ios::sync_with_stdio(0);
    //    cin.tie(0);
    cin >> t;
    if (t == 15734)
        fg = 1;
    while (t--) {
        if (fg && t == 15734 - 980)
            fgg = 1;
        solve();
    }
    return 0;
}