#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(p) p.begin(),p.end()
#define rep(i,a,b) for(int i=(int)a;i<(int)b;i++)
const int mod=998244353;

int main(){
	int N,M;
	cin>>N>>M;
	vector<int> p(N);
	rep(i,0,N) p[i]=i;
	rep(i,0,M){
		int T;cin>>T;
		vector<int> S(T);
		rep(j,0,T) cin>>S[j],S[j]--;
		vector<int> tmp(T);
		rep(j,0,T) tmp[j]=p[S[j]];
		for(int j=T-2;j>=0;j--) swap(tmp[j+1],tmp[j]);
		rep(j,0,T) p[S[j]]=tmp[j];
	}
	vector<int> q(N+1),seen(N);
	rep(i,0,N){
		if(seen[i]) continue;
		int C=0,tmp=0;
		while(seen[i]==0) C++,seen[i]=1,i=p[i];
		for(int j=2;j*j<=C;j++){
			tmp=0;
			while(C%j==0) C/=j,tmp++;
			q[j]=max(q[j],tmp);
		}
		if(C!=1) q[C]=max(q[C],1);
	}
	ll ans=1;
	rep(i,1,N+1) rep(j,0,q[i]) ans=ans*i%mod;
	cout<<ans<<"\n";
}