#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe;
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
void write(ll x){
    if(x<0)putchar('-'),x=-x;
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
const ll N=3e6+9,Mod=998244353,inv2=(Mod+1)/2;
ll T,n,m,c1,c2,a1[N],a2[N],vx[N],vy[N],ans,fail[N];
ll mnp[N],pr[N],prc,vis[N],fac[N],ifac[N],pw2[N];
ll pw(ll x,ll p){
    ll res=1;
    while(p){
        if(p&1)res=res*x%Mod;
        x=x*x%Mod;
        p>>=1;
    }
    return res;
}
void init(ll n){
    pw2[0]=1;
    rep(i,1,n)pw2[i]=pw2[i-1]*2%Mod;
    fac[0]=1;
    rep(i,1,n)fac[i]=fac[i-1]*i%Mod;
    ifac[n]=pw(fac[n],Mod-2);
    per(i,n-1,0)ifac[i]=ifac[i+1]*(i+1)%Mod;
    mnp[1]=1;
    rep(i,2,n){
        if(!vis[i])pr[++prc]=i,mnp[i]=i;
        rep(j,1,prc){
            if(pr[j]*i>n)break;
            vis[i*pr[j]]=1;
            mnp[i*pr[j]]=pr[j];
            if(i%pr[j]==0)break;
        }
    }
    rep(i,1,10)cerr<<mnp[i]<<" ";
    cout<<"\n";
}
vector<ll>a[N],to[N];
void adde(ll x,ll y){
    to[x].push_back(y);
    to[y].push_back(x);
}
vector<vector<ll> >v1,v2;
ll Bord(vector<ll>&a){
    ll n=a.size();
    rep(i,0,n)fail[i]=0;
    fail[0]=-1;
    rep(i,1,n-1){
        ll j=fail[i-1];
        while(j>=0&&a[j+1]!=a[i])j=fail[j];
        if(a[j+1]==a[i])j++;
        fail[i]=j;
    }
    if(n%(n-1-fail[n-1]))return n;
    return n-1-fail[n-1];
}
ll Row(ll x){
    map<ll,ll>mp;
    for(vector<ll>&vec2:v2){
        vector<ll>nv;
        for(ll y:vec2)nv.push_back(a[x][y]);
        ll len=Bord(nv);
        map<ll,ll>factor;
        while(len>1){
            factor[mnp[len]]++;
            len/=mnp[len];
        }
        for(pii p:factor)mp[p.first]=max(mp[p.first],p.second);
    }
    ll res=1;
    for(pii p:mp)res=res*pw(p.first,p.second)%Mod;
    return res;
}
ll Col(ll y){
    map<ll,ll>mp;
    for(vector<ll>&vec1:v1){
        vector<ll>nv;
        for(ll x:vec1)nv.push_back(a[x][y]);
        ll len=Bord(nv);
        map<ll,ll>factor;
        while(len>1){
            factor[mnp[len]]++;
            len/=mnp[len];
        }
        for(pii p:factor)mp[p.first]=max(mp[p.first],p.second);
    }
    ll res=1;
    for(pii p:mp)res=res*pw(p.first,p.second)%Mod;
    return res;
}
void dfs(ll x){
    vis[x]=1;
    for(ll y:to[x]){
        if(!vis[y])dfs(y);
    }
}
ll work(){
    rep(i,0,n+m+1)vis[i]=0;
    ll cm=n+m+1;
    rep(i,0,n+m){
        if(!vis[i])dfs(i),cm--;
    }
    return pw2[cm];
}
void solve(){
    n=read(),m=read();
    rep(i,0,n+1)vector<ll>().swap(a[i]),a[i].resize(m+1);
    rep(i,1,n){
        rep(j,1,m)a[i][j]=read();
    }
    rep(i,0,n+m+1)to[i].clear();
    v1.clear(),v2.clear();
    c1=0,c2=0;
    rep(i,1,n){
        if(i&1)a1[++c1]=i;
    }
    rep(i,1,n){
        if(!(i&1))a1[++c1]=i;
    }
    rep(i,1,m){
        if(i&1)a2[++c2]=i;
    }
    rep(i,1,m){
        if(!(i&1))a2[++c2]=i;
    }
    rep(i,0,max(n,m)+1)vx[i]=vy[i]=0;
    ans=1;
    rep(i,1,n){
        if(a1[i]!=i&&!vx[i]){
            vector<ll>vec;
            ll tmp=i;
            while(!vx[tmp]){
                vec.push_back(tmp);
                vx[tmp]=1;
                tmp=a1[tmp];
            }
            v1.push_back(vec);
        }
    }
    rep(i,1,m){
        if(a2[i]!=i&&!vy[i]){
            vector<ll>vec;
            ll tmp=i;
            while(!vy[tmp]){
                vec.push_back(tmp);
                vy[tmp]=1;
                tmp=a2[tmp];
            }
            v2.push_back(vec);
        }
    }
    for(vector<ll>&vec1:v1){
        for(vector<ll>&vec2:v2){
            map<ll,ll>mp;
            ll cnt=0,mx=0;
            for(ll x:vec1){
                for(ll y:vec2)cnt++,mp[a[x][y]]++;
            }
            ans=ans*fac[cnt]%Mod;
            for(pii p:mp)ans=ans*ifac[p.second]%Mod,mx=max(p.second,mx);
            if(mx==1){
                ans=ans*inv2%Mod;
                adde((vec2.size()&1?0:vec1[0]),(vec1.size()&1?0:vec2[0]+n));
            }
        }
    }
    rep(i,1,n){
        if(a1[i]==i)ans=ans*Row(i)%Mod;
    }
    rep(i,1,m){
        if(a2[i]==i)ans=ans*Col(i)%Mod;
    }
    ans=ans*work()%Mod;
    write(ans),putchar('\n');
}
bool Med;
int main(){
    cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
    init(3e6);
    T=read();
    while(T--)solve();
    return 0;
}