#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 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;
}

string s[maxn];
vector<int> v[maxn];
int check(int u) {
  string base(s[1].size(), '0');
  for(int i : v[u]) {
    int flg = 1;
    for(int j = 0; s[i][j]; j++) {
      if(s[i][j] == '1' && base[j] == '1') {
        flg = 0; break;
      }
    }
    if(!flg) {
      flg = 1;
      reverse(s[i].begin(), s[i].end());
      for(int j = 0; s[i][j]; j++) {
        if(s[i][j] == '1' && base[j] == '1') {
          flg = 0; break;
        }
      }
    }
    if(!flg) return 0;
    for(int j = 0; s[i][j]; j++) {
      if(s[i][j] == '1') base[j] = '1';
    }
  }
  return 2;
}
int r, c;
void solve() {
  r = qread(), c = qread();
  
  int res = 1;
  for(int i = 1; i <= r; ++i) {
    fa[i] = i;
    v[i].clear();
  }
  for(int i = 0; i <= c; ++i) {
    fi[i] = 0;
  }
  
  for(int i = 1; i <= r; ++i) {
    cin >> s[i];
    for(int j = 0, id; j < c; j++) {
      if(s[i][j] == '0') continue; 
      id = min(j, c - j + 1);
      if(fi[id]) cmb(fi[id], i);
      else fi[id] = i;
    }
  }
  for(int i = 1; i <= r; i++) v[find(i)].push_back(i);
  for(int i = 1; i <= r; i++) {
    if(find(i) == i) res = res * check(i) % mod;
  }
  cout << res << '\n';
}
int t;
signed main() {
  t = qread();
  while(t--) {
    solve();
  }
  return 0;
}
/*
5
5 6
100001
010000
000010
000100
001000
*/