#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <cstdio>
#include <cctype>
#include <vector>
#include <cmath>
#include <queue>
using namespace std;
#define ll long long
#define pii pair <int,int>
#define endl '\n'
#define mp make_pair
const int N = 2e6 + 10;
const ll mod=1e9+7;
vector <vector<int> > a;
vector <bool> vis;
vector <int> col;
vector <pii> G[N];
int r,c;
char s[N];
int ck[N],tmp[N];
int p[N];
int find(int x){
    if(x!=p[x]){
        p[x]=find(p[x]);
    }
    return p[x];
}
ll qsm(ll a,ll b){
    ll res=1;
    while(b){
        if(b&1)res=res*a%mod;
        a=a*a%mod;
        b>>=1;
    }
    return res;
}
bool dfs(int x) {
    //cout << x << " " << col[x] << endl;
    vis[x] = 1;
    bool flag = 1;
    for (auto [y,w] : G[x]) {
        if (!vis[y]) {
            if (w == 1) col[y] = col[x];
            else col[y] = 3 - col[x];
            dfs(y);
        } else {
            int now = 0;
            if (w == 1) {
                now = col[y] == col[x];
            } else {
                now = col[y] == (3 - col[x]);
            }
            if (!now) flag = 0;
        }
    }
    return flag;
}
void solve() {
    cin >> r >> c;
    a.clear();vis.clear();col.clear();
    for(int i=1;i<=2*r;i++){
        ck[i]=0;tmp[i] = 0;
        p[i]=i;
        G[i].clear();
    }
    a.resize(r+1);
    vis.resize(r+1);
    col.resize(r+1);
    for (int i = 1;i <= r;++i) {
        cin >> s;
        a[i].resize(c+1);
        for (int j = 0;j < c;++j) {
            a[i][j+1] = s[j] - '0';
        }
    }
    for(int i=1;i<=c;i++){
        int cnt=0;
        for(int j=1;j<=r;j++){
            if(a[j][i]==1)cnt++;
            if(a[j][c-i+1]==1)cnt++;
        }
        if(cnt>2){
            cout<<0<<endl;
            return;
        }
    }
    for(int i=1;i<=r;i++){
        for(int j=1;j<=c;j++){
            tmp[j]=ck[j];
        }
        for(int j=1;j<=c;j++){
            int x=j,y=c-j+1;
            if(y!=x&&a[i][j]&&tmp[y]){
                int pd1=tmp[y];
                G[i].push_back(mp(pd1,1));
                G[pd1].push_back(mp(i,1));
                //printf("(%d,%d)=%d\n",i,pd1,1);
            }else if(a[i][j]&&tmp[j]){
                int pd1=tmp[j];
                G[i].push_back(mp(pd1,2));
                G[pd1].push_back(mp(i,2));
                //printf("(%d,%d)=%d\n",i,pd1,2);
            }
            if(a[i][j])ck[j]=i;
        }
    }
    int cnt=0,qwq=0;
    for(int i=1;i<=r;i++){
        if (!vis[i]) {
            col[i] = 1;
            bool flag = dfs(i);
            //printf("%d:%d\n",i,flag);
            if (flag) ++cnt;
           // else qwq = 1;
        }
    }
    if (!qwq) cout<<qsm(2,cnt)<<endl;
    else cout << "-1\n";
}
signed main() {
   // ios::sync_with_stdio(false);
    int T;cin >> T;
    while (T--) solve(); 
    return 0;
}