#include <bits/stdc++.h>
using namespace std;
const int MAXN = 3000005, P = 998244353;
int T, n, m;
int a[MAXN];
vector<int> vn[MAXN], vm[MAXN];
int cn, cm;
bool vis[MAXN];
int p[MAXN], qn[MAXN], qm[MAXN];
int fa[MAXN];
int find(int x) {
    return fa[x] == x ? x : fa[x] = find(fa[x]);
}
bool merge(int x, int y) {
    x = find(x), y = find(y);
    if (x != y) {
        fa[x] = y;
        return true;
    } else {
        return false;
    }
}
int inv[MAXN];
int lcm(int a, int b) { return a / __gcd(a, b) * b; }
int f(int x, int y) { return a[(x - 1) * m + (y - 1)]; }
int s[MAXN], nxt[MAXN];
int kmp(int n) {
    for (int i = 2, j = 0; i <= n; i++) {
        while (j && s[j + 1] != s[i]) j = nxt[j];
        if (s[j + 1] == s[i]) j++;
        nxt[i] = j;
    }
    for (int j = nxt[n]; j; j = nxt[j]) if (n % (n - j) == 0)
        return n - j;
    return n;
}
int cnt[MAXN];
int main() {
    inv[1] = 1;
    for (int i = 2; i <= 3000000; i++)
        inv[i] = P - 1ll * (P / i) * inv[P % i] % P;
    scanf("%d", &T);
    while (T--) {
        cn = cm = 0;
        scanf("%d%d", &n, &m);
        for (int i = 0; i < n * m; i++)
            scanf("%d", &a[i]);
        int o = 0;
        for (int i = 1; i <= n; i += 2) 
            p[i] = ++o, vis[i] = 0;
        for (int i = 2; i <= n; i += 2)
            p[i] = ++o, vis[i] = 0;
        for (int i = 1; i <= n; i++) if (!vis[i]) {
            vn[++cn] = { i };
            for (int j = p[i]; j != i; j = p[j]) {
                vn[cn].push_back(j);
                vis[j] = 1;
            }
        }
        o = 0;
        for (int i = 1; i <= m; i += 2) 
            p[i] = ++o, vis[i] = 0;
        for (int i = 2; i <= m; i += 2)
            p[i] = ++o, vis[i] = 0;
        for (int i = 1; i <= m; i++) if (!vis[i]) {
            vm[++cm] = { i };
            for (int j = p[i]; j != i; j = p[j]) {
                vm[cm].push_back(j);
                vis[j] = 1;
            }
        }
        int ans = 1;
        for (int i = 1; i <= cn; i++) if (vn[i].size() == 1) {
            int w = 1;
            for (int j = 1; j <= cm; j++) {
                int len = 0;
                for (int k : vm[j]) 
                    s[++len] = f(vn[i][0], k);
                w = lcm(w, kmp(len));
            }
            ans = 1ll * ans * w % P;
        }
        for (int i = 1; i <= cm; i++) if (vm[i].size() == 1) {
            int w = 1;
            for (int j = 1; j <= cn; j++) {
                int len = 0;
                for (int k : vn[j]) 
                    s[++len] = f(k, vm[i][0]);
                w = lcm(w, kmp(len));
            }
            ans = 1ll * ans * w % P;
        }
        // printf("ans = %d\n", ans);
        for (int i = 0; i <= cn + cm; i++)
            fa[i] = i;
        for (int i = 1; i <= cn; i++) if (vn[i].size() != 1) {
            for (int j = 1; j <= cm; j++) if (vm[j].size() != 1) {
                bool diff = true;
                int cc = 0;
                for (int x : vn[i]) {
                    for (int y : vm[j]) {
                        // printf("%d, %d\n", x, y);
                        cnt[f(x, y)]++;
                        if (cnt[f(x, y)] > 1) diff = false;
                        ans = 1ll * ans * (++cc) % P * inv[cnt[f(x, y)]] % P;
                    }
                }
                if (diff) {
                    ans = 1ll * ans * ((P + 1) / 2) % P;
                    int u = (vn[i].size() & 1) ? 0 : cn + j;
                    int v = (vm[i].size() & 1) ? 0 : i;
                    if (merge(u, v)) ans = 2ll * ans % P;
                }
                for (int x : vn[i]) {
                    for (int y : vm[j]) {
                        cnt[f(x, y)]--;
                    }
                }
            }
        }
        printf("%d\n", ans);
    }
    return 0;
}

/*
2
4 4
1 2 3 4
3 4 1 2
1 2 4 1
4 3 3 2

3 9
1 8 1 1 8 1 1 8 1
1 8 8 8 8 8 8 8 1
1 1 1 8 8 8 1 1 1

1 8 1 1 8 1 1 8 1 
1 8 8 8 8 8 8 8 1 
1 1 1 8 8 8 1 1 1 

1 8 1 8 1 1 1 1 8 
1 8 8 8 8 8 1 8 8 
1 1 1 1 8 1 1 8 8 



*/