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

#include <atcoder/dsu>
#include <atcoder/modint>
using namespace atcoder;
using mint=modint998244353;

int main(void) {
    int n;
    cin >> n;
    int m;
    cin >> m;
    vector<int> t(m);
    vector<vector<int>> s(m);
    vector<int> a(n);
    for(int i=0;i<n;++i){
        a[i]=i;
    }
    for(int i=0;i<m;++i){
        cin >> t[i];
        s[i].resize(t[i]);
        for(int j=0;j<t[i];++j){
            cin >> s[i][j];
            --s[i][j];
        }
        int tmp=a[s[i][t[i]-1]];
        for(int j=t[i]-1;j>0;--j){
            a[s[i][j]]=a[s[i][j-1]];
        }
        a[s[i][0]]=tmp;
    }
    dsu g(n);
    for(int i=0;i<n;++i){
        g.merge(i,a[i]);
    }
    auto groups=g.groups();
    long long ans=1;
    mint answer=1;
    vector<int> sizes;
    map<int,bool> seen;
    for(auto group: groups){
        if(gcd(ans,group.size())>1e4 && !seen[gcd(ans,group.size())]) {
            seen[gcd(ans,group.size())]=true;
            answer*=gcd(ans,group.size());
        } else if(gcd(ans,group.size())<=1e4) {
            ans=lcm(ans,group.size());
        }
    }
    answer*=ans;
    cout << answer.val() << endl;
    return 0;
}