#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
typedef pair <int, int> pii;

inline int read() {
    int x = 0, f = 0;
    char c = getchar();
    while (!isdigit(c)) {if (c == '-') f = 1; c = getchar();}
    while (isdigit(c)) x = (x << 1) + (x << 3) + (c & 15), c = getchar();
    return f? -x : x;
}

const int MAXN = 1e6;
const int Mod = 1e9 + 7;
vector <int> G[MAXN*2 + 10];
vector <int> pos[MAXN + 10];

int vis[MAXN + 10], p2[MAXN + 10];
void clear(int n, int m) {
    for (int i = 1; i <= n; ++i) {
        vis[i] = 0;
        G[i].clear();
        //vis[i] = vis[i + n] = 0;
        //G[i][0].clear(), G[i][1].clear();
    }
    for (int i = 1; i <= m; ++i)
        pos[i].clear();
}

void dfs(int x) {
    if (vis[x]) return;
    vis[x] = 1;
    for (auto v : G[x])
        dfs(v);
}

inline void add(int x, int y) {
    G[x].pb(y); G[y].pb(x);
}

int main() {
    int T = read(); p2[0] = 1;
    for (int i = 1; i <= MAXN; ++i)
        p2[i] = (p2[i - 1] + p2[i - 1]) % Mod;
    while (T--) {
        int n, m;
        n = read(), m = read();
        for (int i = 1; i <= n; ++i) {
            static char str[MAXN + 10];
            scanf("\n%s", str + 1);
            for (int j = 1; j <= m; ++j)
                if (str[j] == '1')
                    pos[j].pb(i);
        }
        bool ok = 1;
        for (int j = 1; j <= (m + 1) / 2; ++j) {
            int k = m - j + 1;
            if (j == k) {
                ok = pos[j].size() <= 1;
                continue;
            }
            int cc = pos[j].size() + pos[k].size();
            if (cc > 2) {
                ok = 0;
                break;
            }
            else {
                if (cc <= 1) continue;
                if (pos[j].size() ^ pos[k].size()) {
                    int p = pos[j].size()? j : k;
                    add(pos[p][0], pos[p][1]);
                    /*
                       G[pos[p][0]].pb(pos[p][1] + n);
                       G[pos[p][0] + n].pb(pos[p][1]);
                       G[pos[p][1]].pb(pos[p][0] + n);
                       G[pos[p][1] + n].pb(pos[p][0]);
                     */
                }
                else {
                    add(pos[j][0], pos[k][0]);
                    /*
                       G[pos[j][0]].pb(pos[k][0]);
                       G[pos[j][0] + n].pb(pos[k][0] + n);
                       G[pos[k][0]].pb(pos[j][0]);
                       G[pos[k][0] + n].pb(pos[j][0] + n);
                     */
                }
            }
        }
        if (!ok) {
            printf("0\n");
        }
        else {
            int cnt = 0;
            for (int i = 1; i <= n; ++i)
                if (!vis[i]) ++cnt, dfs(i);
            printf("%d\n", p2[cnt]);
        }
        clear(n, m);
    }
    return 0;
}