#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using pi=pair<int,int>;
#define fi first
#define se second
const int N=3e6+5,mod=998244353,i2=(mod+1)/2;
int n,m,n0,m0,p[N],q[N],nxt[N],ct[N],fa[N*2];
bool vis[N];
ll inv[N],fc[N];
vector<vector<int>>a;
vector<int>cx[N],cy[N];
ll qp(ll a,int b){ll ans=1;for(;b;b>>=1,a=a*a%mod)if(b&1)ans=ans*a%mod;return ans;}
int gf(int x){return x==fa[x]?x:fa[x]=gf(fa[x]);}
ll lcm(ll x,ll y){return x/__gcd(x,y)*y;}
void init(int n) {
    fc[0]=1;for(int i=1;i<=n;i++)fc[i]=fc[i-1]*i%mod;
    inv[n]=qp(fc[n],mod-2);
    for(int i=n-1;~i;i--)inv[i]=inv[i+1]*(i+1)%mod;
}
int calc(vector<int>&a) {
    int n=a.size();nxt[1]=0;
    for(int i=2;i<=n;i++) {
        int j=nxt[i-1];
        while(j&&a[j]!=a[i-1])j=nxt[j];
        nxt[i]=j+(a[i-1]==a[j]);
    }return n%(n-nxt[n])?n:n-nxt[n];
}
void solve() {
    cin>>n>>m,n0=m0=0;
    a=vector<vector<int>>(n+1,vector<int>(m+1));
    for(int i=1;i<=n;i++)p[i]=(i&1?i/2+1:(n+1)/2+i/2);
    for(int i=1;i<=m;i++)q[i]=(i&1?i/2+1:(m+1)/2+i/2);
    for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)cin>>a[i][j];
    fill(vis,vis+n+1,0);
    for(int i=1;i<=n;i++)if(!vis[i]) {
        int x=i;cx[++n0].clear();
        while(!vis[x])cx[n0].push_back(x),vis[x]=1,x=p[x];
    }
    fill(vis,vis+m+1,0);
    for(int i=1;i<=m;i++)if(!vis[i]) {
        int x=i;cy[++m0].clear();
        while(!vis[x])cy[m0].push_back(x),vis[x]=1,x=q[x];
    }
    ll ans=1;
    for(int i=1;i<=n;i++)if(p[i]==i) {
        ll s=1;
        for(int j=1;j<=m0;j++) {
            vector<int>v;
            for(int k:cy[j])v.push_back(a[i][k]);
            s=lcm(s,calc(v));
        }ans=s%mod*ans%mod;
    }
    for(int i=1;i<=m;i++)if(q[i]==i) {
        ll s=1;
        for(int j=1;j<=n0;j++) {
            vector<int>v;
            for(int k:cx[j])v.push_back(a[k][i]);
            s=lcm(s,calc(v));
        }ans=s%mod*ans%mod;
    }
    iota(fa+1,fa+n0+m0+2,1);
    for(int i=1;i<=n0;i++)if(cx[i].size()!=1)for(int j=1;j<=m0;j++)if(cy[j].size()!=1) {
        bool fl=0;int p=cx[i].size(),q=cy[j].size();
        for(int x:cx[i])for(int y:cy[j])fl|=ct[a[x][y]],ct[a[x][y]]++;
        ans=ans*fc[p*q]%mod;
        for(int x:cx[i])for(int y:cy[j])ans=ans*inv[ct[a[x][y]]]%mod,ct[a[x][y]]=0;
        if(!fl) {
            int x=(cy[j].size()&1?n0+m0+1:i),y=(cx[i].size()&1?n0+m0+1:n0+j);
            x=gf(x),y=gf(y);if(x!=y)fa[x]=y;else ans=ans*i2%mod;
        }
    }cout<<ans<<'\n';
}
int main() {
    #ifndef ONLINE_JUDGE
        freopen(".in","r",stdin);
        freopen(".out","w",stdout);
    #endif
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int tt;cin>>tt,init(1e6);
    while(tt--)solve();
    return 0;
}