#include <bits/stdc++.h>

#define multi_test 1
#define DEBUG 0

using LL = long long;
using PII = std::pair<int, int>;

constexpr int mod = 1e9 + 7;

LL fpow(LL a, LL b, LL mod) {
  LL res = 1;
  for (; b; b >>= 1) {
    if (b & 1) {
      res = res * a % mod;
    }
    a = a * a % mod;
  }
  return res;
}

int solve() {
  int n, m;
  std::cin >> n >> m;

  std::vector<std::string> a(n);
  std::vector<std::vector<int>> pos(m);

  int cnt1 = 0;
  bool flag = true;
  for (int i = 0; i < n; ++i) {
    std::cin >> a[i];
    for (int j = 0; j < m and flag; ++j) {
      if (a[i][j] == '1') {
        ++cnt1;
        pos[j].push_back(i);
        if (cnt1 > m or pos[j].size() + pos[m - 1 - j].size() > 2)
          flag = false;
      }
    }
  }

  if (not flag) {
    return 0;
  }

  int cnt = 0;
  std::vector<bool> vis(n);
  for (int i = 0; i < n; ++i) {
    if (vis[i])
      continue;
    cnt++;
    vis[i] = true;

    auto &s = a[i];
    for (int j = 0; j < m; ++j) {
      if (s[j] == '0')
        continue;

      std::vector<int> tmp;
      for (auto x : pos[j])
        if (x != i)
          tmp.push_back(x);
      for (auto x : pos[m - 1 - j])
        if (x != i)
          tmp.push_back(x);

      if (tmp.size() == 1) {
        vis[tmp[0]] = true;
      }
    }
  }

  return fpow(2, cnt, mod);
}

int main() {
  std::cin.tie(nullptr)->sync_with_stdio(false);
  if constexpr (DEBUG) {
    std::cerr.tie(nullptr);
    freopen("data.in", "r", stdin);
  }

  int T = 1;
  if constexpr (multi_test) {
    std::cin >> T;
  }

  while (T--) {
    std::cout << solve() << '\n';
  }
}