#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <queue>
#include <bitset>
#include <vector>
#include <stack>
#include <cmath>
#include <set>
#include <cassert>
#include <random>
#include <chrono>
#include <ctime>
#include <cstdlib>
#define pii pair<int,int> 
#define mp make_pair
#define pb emplace_back
#define debug() cout<<"qwq"<<endl
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef unsigned long long ull;
const int DMAX = 1000000 + 5;
const double INF = 1e9;
const int MOD = 1000000000 + 7;
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
template<class T> inline void read(T &x){
    T f=1; x=0; char ch=getchar();
    while(ch<'0' || ch>'9'){
        if(ch=='-') f=-1; 
        ch=getchar();
    }
    while(ch<='9' && ch>='0'){ x=x*10+ch-'0';ch=getchar(); }
    x*=f;
}
struct DSU{
    vector<int> fa;
    int n;
    void init(){
        fa.resize(n);
        for(int i = 0; i < n; i++) fa[i] = i;
    }
    int find(int p){
        if(p == fa[p]) return p;
        return fa[p] = find(fa[p]);
    }
    void merge(int x, int y){
        x = find(x), y = find(y);
        if(x != y){
            fa[x] = y;
        }
    }
};
DSU dsu;
int T;
char s[DMAX];
int n, m;
vector<vector<int> > a;
int sum[DMAX];
vector<vector<int> > l;
int t[DMAX];
void solve(){
    read(n), read(m);
    a.clear(), l.clear();
    l.resize(m);
    a.resize(n);
    for(int i = 0; i < n; i++) a[i].resize(m);
    for(int i = 0; i < m; i++) sum[i] = 0;
    for(int i = 0; i < n; i++){
        scanf("%s", s);
        for(int j = 0; j < m; j++){
            a[i][j] = s[j] - '0';
            if(a[i][j]){
                sum[j] ++;
                l[min(j, m - 1 - j)].pb(i);
            }
        }
    }  
    int qwe = 0;
    for(int j = 0; j < m; j++){
        qwe += sum[j];
        if(sum[j] >= 3){
            puts("0");
            return ;
        }
    }
    if(qwe > m){
        puts("0");
        return ;
    }
    for(int j = 0; j < m; j++){
        int x = 0;
        if(j != m - 1 - j){
            x = sum[j] + sum[m - 1 - j];
            if(x >= 3){
                puts("0");
                return ;
            }
        }
        else{
            x = sum[j];
            if(x >= 2){
                puts("0");
                return ;
            }
        }
    }
    dsu.n = 2 * n, dsu.init();
    for(int j = 0; j < m; j++){
        if(j > m - 1 - j) break;
        if(l[j].size() == 2){
            int x = l[j][0], y = l[j][1];
            if(x == y) continue;
            dsu.merge(x, y + n), dsu.merge(x + n, y);
            //cout<<x<<" "<<y<<endl;
        }
    }
    int cnt = 0;
    for(int j = 0; j < n; j++){
        if(dsu.find(j) == dsu.find(j + n)){
            puts("0");

            return ;
        }
    }
    for(int j = 0; j < 2 * n; j++){
        if(dsu.find(j) == j) cnt ++;
    }
    printf("%d\n", t[cnt / 2]);
    return ;
}
int main(){
    t[0] = 1;
    for(int i = 1; i <= 1000000; i ++){
        t[i] = 1ll * t[i - 1] * 2 % MOD;
    }
    read(T);
    while(T--){
        solve();
    }
    return 0;
}