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

void solve() {
  int n, m;
  std::cin >> n >> m;
  std::vector<std::string> a(n);
  int cnt1 = 0;
  for (int i = 0; i < n; ++i) {
    std::cin >> a[i];
    for (int j = 0; j < m; ++j) {
      if (a[i][j] == '1') {
        ++cnt1;
      }
    }
  }
  if (cnt1 > m) {
    std::cout << 0 << '\n';
    return;
  }
  LL cnt_palindrome = 0, cnt_not_palindrome = 0;
  for (auto &v : a) {
    bool flag = true;
    for (int i = 0, j = m - 1; i < j; ++i, --j) {
      if (v[i] != v[j]) {
        flag = false;
        break;
      }
    }
    if (flag) {
      ++cnt_palindrome;
    } else {
      ++cnt_not_palindrome;
    }
  }
  if (cnt_not_palindrome) {
    cnt_palindrome++;
  }
  std::cout << fpow(2, cnt_palindrome, mod) << '\n';
}

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--) {
    solve();
  }
}