#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using db = long double;
using ch = char;
using bl = bool;
using st = string;
using pll = pair<ll,ll>;
using psl = pair<st,ll>;
using vst = vector<st>;
using vch = vector<ch>;
using vvch = vector<vch>;
using vbl = vector<bl>;
using vvbl = vector<vbl>;
using vdb = vector<db>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using vpsl = vector<psl>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vvvvll = vector<vvvll>;
using vvvvvll = vector<vvvvll>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
#define all(A) A.begin(),A.end()
#define sz(A) (ll)A.size()
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rrep(i,a,b) for(ll i=(ll)(a);i<=(ll)(b);i++)
#define drep(i,n) for(ll i=(ll)n-1; i>=0; i--)
#define drrep(i,a,b) for(ll i=(ll)a; i>=(ll)b; i--)

using mint = modint998244353;
// using mint = modint1000000007;
using vm = vector<mint>;
using vvm = vector<vm>; 
using vvvm = vector<vvm>;

const ll mod = 998244353;
const ll INF = 3e18;

template<class T> inline bool chmin(T &a, T b)
{
    if (a>b)
    {
        a=b;
        return true;
    }
    return false;
}

template<class T> inline bool chmax(T &a, T b)
{
    if (a<b)
    {
        a=b;
        return true;
    }
    return false;
}

ll gcd(ll a, ll b)
{
    if (a==0)return b;
    if (b==0)return a;
    ll c=a;
    while(a%b!=0)
    {
        c=a%b;
        a=b;
        b=c;
    }
    return b;
}

ll lcm(ll a,ll b){
    return a/gcd(a,b)*b;
}

ll Pow(ll a, ll n)
{
    ll res=1;
    while(n>0)
    {
        if(n%2==1)res*=a;
        a*=a;
        n/=2;
    }
    return res;
}

ll Pow(ll a, ll n, ll p)
{
    ll res=1;
    while(n>0)
    {
        a%=p;
        if(n%2==1)res*=a;
        a*=a;
        res%=p;
        n/=2;
    }
    return res;
}

void yn(bl ok)
{
    cout << (ok?"Yes":"No") << endl;
    return;
}

vpll pf(ll n)
{
    vpll res;
    for (ll i=2; i*i<=n; i++)
    {
        if (n%i!=0) continue;
        ll ex=0;
        while(n%i==0)
        {
            ex++;
            n/=i;
        }
        res.pb(mp(i,ex));
    }
    if (n!=1)res.pb(mp(n,1));
    return res;
}

ll N,M,P[1010101];

int main()
{
    cin>>N>>M;
    rrep(i,1,N)P[i]=i;
    rep(i,M)
    {
        ll T;
        cin>>T;
        vll S(T);
        rep(j,T)cin>>S[j];
        ll memo=P[S.back()];
        drep(j,T)
        {
            if(j>0)P[S[j]]=P[S[j-1]];
            else P[S[j]]=memo;
        }
    }
    dsu uf(N);
    rrep(i,1,N)uf.merge(i-1,P[i]-1);
    map<ll,ll>m;
    for(vi v:uf.groups())
    {
        ll n=sz(v);
        for(pll p:pf(n))
        {
            chmax(m[p.first],p.second);
        }
    }
    mint ans=1;
    for(auto p:m)
    {
        rep(i,p.second)ans*=p.first;
    }
    cout << ans.val() << endl;
    return 0;
}