#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
typedef long long ll;
ll qpow(ll  x, ll  b,ll mod = 1e9 + 7)
{
    ll ans = 1,k = x;
    while (b != 0)
    {
        if (b & 1)ans = ans * k;
        ans %= mod;
        k = k * k;
        b = b / 2;
    }
    return ans;
}
int fa[1000000 + 100];
int find(int x) {
    if (fa[x] == x)return x;
    return fa[x] = find(fa[x]);
}
void merge(int a, int b) {
    fa[find(a)] = fa[find(b)];
}
int main()
{
    int t;
    cin >> t;
    while (t--) {
        int r, c;
        cin >> r >> c;
        vector<vector<int>>m(r + 1);
        vector<int>vis(c + 1, 0);
        for (int i = 0; i <= r+1; i++) {
            fa[i] = i;
        }
        int now = 0;
        for (int i = 1; i <= r; i++) {
            for (int j = 1; j <= c; j++) {
                char temp;
                cin >> temp;
                if (temp == '1') {
                    m[i].push_back(j);
                }
            }
        }
        int cnt = 0;
        for (int i = 1; i <= r; i++) {
            if (m[i].size() == 0) {
                cnt++;
            }
        }
        int bad = 0;
        for (int i = 1; i <= r; i++) {
            if (m[i].size() == 0)continue;
            int org=0,t=0;
            now++;
            for (auto v : m[i]) {
                if (vis[v] != 0) {
                    org = vis[v];
                    merge(vis[v], now);
                }
                //if (vis[v] != 0&&org==0) {
                //    org = vis[v];
                //}
                /*else if (vis[v] != org&&org!=0) {
                    vis[v] = org;
                }*/
            }
            for (auto v : m[i]) {
                if (vis[c - v + 1] != 0) {
                    t = vis[c - v + 1];
                    if (find(vis[c - v + 1]) == find(now) && t != 0) {
                        bad = 1;
                        break;
                    }
                    merge(vis[c - v + 1], now);
                }
                //if (vis[c - v + 1] != 0&&t==0) {
                //    t = vis[c - v + 1];
                //}
                /*else if (vis[c - v + 1] != t&&t!=0) {
                    vis[c - v + 1] = t;
                }*/
            }
            if (bad == 1)break;
            if (org == 0&&t==0) {
                for (auto v : m[i]) {
                    vis[v] = now;
                }
            }
            else if(t==0){
                //for (auto v : m[i]) {
                //    vis[v] = org;
                //}
                //merge(org, now);
                for (auto v : m[i]) {
                    vis[c - v + 1] = now;
                }
            }
            else if(org==0){
                //for (auto v : m[i]) {
                //    vis[v] = t;
                //}
                //merge(t, now);
                for (auto v : m[i]) {
                    vis[c - v + 1] = now;
                }
            }
            else {
                //merge(org, now);
                //merge(t, now);
                for (auto v : m[i]) {
                    if(vis[v]!=0){
                        vector<int>need;
                        for (int h = 0; h < vis.size(); h++) {
                            if (vis[h] == vis[v]) {
                                need.push_back(h);
                            }
                        }
                        for (auto h : need) {
                            swap(vis[h], vis[c - h + 1]);
                        }
                    }
                }
                for (auto v : m[i]) {
                    vis[v] = now;
                }
            }
        }
        set<int>ok;
        for (auto i : vis) {
            if(i!=0)
            ok.insert(find(i));
        }
        if (bad == 1) {
            cout << 0 << "\n";
        }
        else {
            cout << qpow(2, ok.size() + cnt) << "\n";
        }
    }
    return 0;
}