#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;

constexpr int LIM_INV = 3'000'010;
Mint inv[LIM_INV], fac[LIM_INV], invFac[LIM_INV];

void prepare() {
  inv[1] = 1;
  for (int i = 2; i < LIM_INV; ++i) {
    inv[i] = -((Mint::M / i) * inv[Mint::M % i]);
  }
  fac[0] = invFac[0] = 1;
  for (int i = 1; i < LIM_INV; ++i) {
    fac[i] = fac[i - 1] * i;
    invFac[i] = invFac[i - 1] * inv[i];
  }
}
Mint binom(Int n, Int k) {
  if (n < 0) {
    if (k >= 0) {
      return ((k & 1) ? -1 : +1) * binom(-n + k - 1, k);
    } else if (n - k >= 0) {
      return (((n - k) & 1) ? -1 : +1) * binom(-k - 1, n - k);
    } else {
      return 0;
    }
  } else {
    if (0 <= k && k <= n) {
      assert(n < LIM_INV);
      return fac[n] * invFac[k] * invFac[n - k];
    } else {
      return 0;
    }
  }
}


vector<int> uf;
int root(int u) {
  return (uf[u] < 0) ? u : (uf[u] = root(uf[u]));
}
bool connect(int u, int v) {
  u = root(u);
  v = root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}


vector<vector<int>> decompose(int n) {
  vector<int> to;
  for (int u = 0; u < n; u += 2) to.push_back(u);
  for (int u = 1; u < n; u += 2) to.push_back(u);
  vector<vector<int>> uss;
  vector<int> vis(n, 0);
  for (int s = 0; s < n; ++s) if (!vis[s]) {
    vector<int> us;
    for (int u = s; !vis[u]; u = to[u]) {
      vis[u] = 1;
      us.push_back(u);
    }
    uss.push_back(us);
  }
  return uss;
}

int getPeriod(const vector<int> &as) {
  const int n = as.size();
  vector<int> fail(n + 1);
  int j = fail[0] = -1;
  for (int i = 0; i < n; ++i) {
    for (; ~j && as[j] != as[i]; j = fail[j]) {}
    fail[i + 1] = ++j;
  }
  const int per = n - fail[n];
  return (n % per == 0) ? per : n;
}

/*
  by row, col, row^-1, col^-1:
      o
    o o
  generates Alt = <(1 2 3), (1 2 4), ...>
  (casework)
*/

int M, N;
vector<vector<int>> A;

int main() {
  prepare();
  
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d%d", &M, &N);
    A.assign(M, vector<int>(N));
    for (int x = 0; x < M; ++x) for (int y = 0; y < N; ++y) {
      scanf("%d", &A[x][y]);
    }
    
    const auto xss = decompose(M);
    const auto yss = decompose(N);
// cerr<<xss<<" "<<yss<<endl;
    const int E = xss.size();
    const int F = yss.size();
    
    Mint ans = 1;
    
    // 1
    for (int e = 0; e < E; ++e) if (xss[e].size() == 1) {
      // divides order of 2 mod (N-[2|N])
      Int lcm = 1;
      for (int f = 0; f < F; ++f) if (yss[f].size() > 1) {
        vector<int> as;
        for (const int x : xss[e]) for (const int y : yss[f]) {
          as.push_back(A[x][y]);
        }
        const Int res = getPeriod(as);
        lcm = lcm / __gcd(lcm, res) * res;
      }
      ans *= lcm;
    }
    for (int f = 0; f < F; ++f) if (yss[f].size() == 1) {
      // divides order of 2 mod (M-[2|M])
      Int lcm = 1;
      for (int e = 0; e < E; ++e) if (xss[e].size() > 1) {
        vector<int> as;
        for (const int x : xss[e]) for (const int y : yss[f]) {
          as.push_back(A[x][y]);
        }
        const Int res = getPeriod(as);
        lcm = lcm / __gcd(lcm, res) * res;
      }
      ans *= lcm;
    }
// cerr<<"DONE 1: ans = "<<ans<<endl;
    
    // >= 2
    vector<vector<int>> dup(E, vector<int>(F, 0));
    for (int e = 0; e < E; ++e) for (int f = 0; f < F; ++f) {
      if (xss[e].size() > 1 && yss[f].size() > 1) {
        vector<int> as;
        for (const int x : xss[e]) for (const int y : yss[f]) {
          as.push_back(A[x][y]);
        }
        sort(as.begin(), as.end());
        const int asLen = as.size();
        Mint num = fac[asLen];
        for (int i = 0, j; i < asLen; i = j) {
          for (j = i; j < asLen && as[i] == as[j]; ++j) {}
          if (j - i >= 2) {
            dup[e][f] = 1;
            num *= invFac[j - i];
          }
        }
        ans *= num;
      }
    }
// cerr<<"optimistic ans = "<<ans<<endl;
// cerr<<"dup = "<<dup<<endl;
    
    vector<int> ess[2], fss[2];
    for (int e = 0; e < E; ++e) if (xss[e].size() > 1) ess[xss[e].size() & 1].push_back(e);
    for (int f = 0; f < F; ++f) if (yss[f].size() > 1) fss[yss[f].size() & 1].push_back(f);
    
    // |xss[e]|: odd && |yss[e]|: odd ==> only Alt
    for (const int e : ess[1]) for (const int f : fss[1]) {
      if (!dup[e][f]) {
        ans *= inv[2];
      }
    }
    
    // |xss[e]|: odd ==> only yoko-rot changes parity
    for (const int e : ess[1]) {
      int cnt = 0;
      for (const int f : fss[0]) if (!dup[e][f]) ++cnt;
      for (int i = 1; i < cnt; ++i) ans *= inv[2];
    }
    
    // |yss[f]|: odd ==> only tate-rot changes parity
    for (const int f : fss[1]) {
      int cnt = 0;
      for (const int e : ess[0]) if (!dup[e][f]) ++cnt;
      for (int i = 1; i < cnt; ++i) ans *= inv[2];
    }
    
    // even
    uf.assign(E + F, -1);
    for (const int e : ess[0]) for (const int f : fss[0]) {
      if (!dup[e][f]) {
        if (!connect(e, E + f)) {
          ans *= inv[2];
        }
      }
    }
    
    printf("%u\n", ans.x);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}