#include<bits/stdc++.h>
using namespace std;
using ll = long long;



const ll mod = 998'244'353;
//const ll mod = 1'000'000'007;
//const ll mod = 67'280'421'310'721;
struct mint{
    long long x;
    mint(long long x=0):x((x%mod+mod)%mod){}
    mint operator-() const{
        return mint(-x);
    }
    mint& operator+=(const mint& a){
        if((x+=a.x)>=mod)x-=mod;
        return *this;
    }
    mint& operator-=(const mint& a){
        if((x+=mod-a.x)>=mod)x-=mod;
        return *this;
    }
    mint& operator*=(const  mint& a){
        (x *= a.x) %= mod;
        return *this;
    }
    mint operator+(const mint& a) const{
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint& a) const{
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint& a) const{
        mint res(*this);
        return res*=a;
    }
    mint pow(long long n) const {
        assert(0 <= n);
        mint a = *this, r = 1;
        while (n) {
            if (n & 1) r *= a;
            a *= a;
            n >>= 1;
        }
        return r;
    }
    mint inv() const{
        return pow(mod-2);
    }
    mint& operator/=(const mint& a){
        return (*this)*=a.inv();
    }
    mint operator/(const mint& a) const {
        mint res(*this);
        return res/=a;
    }
    friend ostream& operator<<(ostream& os, const mint& m){
        os << m.x;
        return os;
    }
    bool operator==(const mint& a) const {
        return x == a.x;
    }
    bool operator<(const mint& a) const{
        return x < a.x;
    }
};


int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,m;
    cin>>n>>m;
    vector<int> p(n);
    for(int i = 0;i<n;i++) p[i] = i;
    vector<int> cnt(n+1,0);
    for(int i = 0;i<m;i++){
        int t;
        cin>>t;
        vector<int> s(t);
        for(int j = 0;j<t;j++){
            cin>>s[j];
            s[j]--;
        }
        int ni = s[0];
        int now = p[s.back()];
        for(int j = t-1;j>0;j--){
            p[s[j]] = p[s[j-1]];
        }
        p[ni] = now;
    }
    vector<int> vis(n,0);

    for(int i = 0;i<n;i++){
        int d = 1;
        if(vis[i]) continue;
        int ni = i;
        vis[ni] = 1;
        while(true){
            ni = p[ni];
            if(vis[ni]) break;
            vis[ni] = 1;
            d++;
        }
        cnt[d]++;
    }
    mint ans = 1;
    vector<int> can(n+1,0);
    for(int i = 2;i<=n;i++){
        if(can[i]) continue;
        int mx = 0;
        for(int j = i;j<=n;j+=i){
            can[j] = 1;
            if(cnt[j]==0) continue;
            int now = 0;
            int nj = j;
            while(nj%i==0){
                now += 1;
                nj /= i;
            }
            mx = max(now,mx);
        }
        ans *= mint(i).pow(mx);
    }
    cout<<ans<<endl;

}