#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10, mod = 1e9 + 7;
int T, n, m, sum[maxn], fa[maxn << 1];
string g[maxn];
int getfa(int x) {
  if(fa[x] == x) return x;
  return fa[x] = getfa(fa[x]);
}
inline void merge(int x, int y) {
  x = getfa(x), y = getfa(y);
  if(x != y) fa[y] = x;
}
inline void solve() {
  cin >> n >> m;
  for(int i = 1; i <= n; ++i) cin >> g[i], g[i] = ' ' + g[i];
  for(int i = 1; i <= m; ++i) sum[i] = 0;
  for(int i = 1; i <= n; ++i) for(int j = 1; j <= m; ++j) sum[j] += g[i][j] - '0';
  for(int i = 1; i <= m / 2; ++i) if(sum[i] + sum[m - i + 1] > 2) return cout << "0\n", void();
  if(m % 2 && sum[m / 2 + 1] > 1) return cout << "0\n", void();

  for(int i = 1; i <= n + n; ++i) fa[i] = i;
  for(int i = 1; i <= m / 2; ++i) if(sum[i] + sum[m - i + 1] == 2) {
    if(sum[i] == 2) {
      int r1 = 0, r2 = 0;
      for(int j = 1; j <= n; ++j) if(g[j][i] == '1') r2 = r1, r1 = j;
      merge(r1, r2 + n), merge(r1 + n, r2);
    } else if(sum[m - i + 1] == 2) {
      int r1 = 0, r2 = 0;
      for(int j = 1; j <= n; ++j) if(g[j][m - i + 1] == '1') r2 = r1, r1 = j;
      merge(r1, r2 + n), merge(r1 + n, r2);
    } else {
      int r1 = 0, r2 = 0;
      for(int j = 1; j <= n; ++j) if(g[j][i] == '1') r1 = j;
      for(int j = 1; j <= n; ++j) if(g[j][m - i + 1] == '1') r2 = j;
      merge(r1, r2), merge(r1 + n, r2 + n);
    }
  }
  int cnt = 0, ans = 1;
  for(int i = 1; i <= n + n; ++i) if(getfa(i) == i) ++cnt;
  for(int i = 1; i <= cnt / 2; ++i) ans = (ans << 1) % mod;
  cout << ans << '\n';
}
int main() {
  ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  cin >> T;
  while(T--) solve();
  return 0;
}