#include <bits/stdc++.h>
#define maxn 1000007
#define int long long
#define dl long double
#define mod 1000000007
using namespace std;
inline int pls(int a, int b) {int m = a + b; return m < mod ? m : m - mod;}
inline int dec(int a, int b) {int m = a - b; return m < 0 ? m + mod : m;}
inline int mul(int a, int b) {return 1ll * a * b % mod;}
inline int fpow(int a, int b) {
  int ans = 1;
  for(; b; b >>= 1,a = mul(a, a)) if(b & 1) ans = mul(ans, a);
  return ans;
}
inline int inv(int a) {return fpow(a, mod - 2);}
inline int dvi(int a, int b) {return mul(a, inv(b));};
inline int qread() {
  char c = getchar(); int num = 0, f = 1;
  for(; !isdigit(c); c=getchar()) if(c == '-') f = -1;
  for(; isdigit(c); c=getchar()) num = num * 10 + c - '0';
  return num * f;
}

int num[maxn], fa[maxn], fi[maxn];
char in[maxn];
int find(int u) {
  return (u == fa[u]) ? u : fa[u] = find(fa[u]);
} 
void cmb(int a, int b) {
  a = find(a), b = find(b);
  fa[a] = b;
}
int check(int l) {
  for(int i = 1; i <= l / 2; ++i) {
    if(in[i] != in[l - i + 1]) return 0;
  }
  return 1;
}
int r, c;
void solve() {
  r = qread(), c = qread();
  
  int res = 1, has = 1;
  for(int i = 1; i <= r; ++i) fa[i] = i;
  for(int i = 1; i <= c; ++i) {
    num[i] = 0; fi[i] = 0;
  }
  
  for(int i = 1; i <= r; ++i) {
    scanf("%s", in + 1);
    for(int j = 1, id; j <= c; j++) {
      if(in[j] == '0') continue; 
      id = min(j, c - j + 1);
      num[id]++;
      if(num[id] >= 3 || (id == (c + 1) / 2 && (c % 2) && num[id] >= 2)) {
        has = 0;
        break;
      }
      if(fi[id]) cmb(fi[id], i);
      else fi[id] = i;
    }
  }
  if(has) {
    for(int i = 1; i <= r; i++) res = res * ((fa[i] == i) + 1) % mod;
    cout << res << '\n';
  }
  else {
    cout << 0 << '\n';
  }
}
int t;
signed main() {
  t = qread();
  while(t--) {
    solve();
  }
  return 0;
}
/*
5
5 6
100001
010000
000010
000100
001000
*/