#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using VS = vector<string>;
using P = pair<ll,ll>;
using VP = vector<P>;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define out(x) cout << x << endl
#define dout(x) cout << fixed << setprecision(10) << x << endl
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(x) (int)(x.size())
#define re0 return 0
#define pcnt __builtin_popcountll
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
constexpr int inf = 1e9;
constexpr ll INF = 1e18;
//using mint = modint1000000007;
using mint = modint998244353;
int di[4] = {1,0,-1,0};
int dj[4] = {0,1,0,-1};

vector<pair<long long, long long> > prime_factorize(long long N) {
    vector<pair<long long, long long> > res;
    for (long long a = 2; a * a <= N; ++a) {
        if (N % a != 0) continue;
        long long ex = 0; // 指数

        while (N % a == 0) {
            ++ex;
            N /= a;
        }

        res.push_back({a, ex});
    }

    if (N != 1) res.push_back({N, 1});
    return res;
}

int main(){
    int n,m;
    cin >> n >> m;
    VI p(n);
    iota(all(p),0);
    rep(mi,m){
        int t;
        cin >> t;
        VI s(t);
        rep(i,t){
            cin >> s[i];
            s[i]--;
        }
        int ls = p[s.back()];
        for(int i = t-2;i >= 0;i--){
            p[s[i+1]] = p[s[i]];
        }
        p[s[0]] = ls;
    }
    /* rep(i,n) cout << p[i]+1 << ' ';
    cout << endl; */
    dsu uf(n);
    rep(i,n) uf.merge(i,p[i]);
    map<ll,ll> mp;
    rep(i,n){
        if(uf.leader(i) != i) continue;
        VP pr = prime_factorize(uf.size(i));
        for(auto c:pr){
            if(!mp.count(c.first)){
                mp[c.first] = c.second;
            } else {
                chmax(mp[c.first],c.second);
            }
        }
    }
    mint ans = 1;
    for(auto c:mp){
        ans *= mint(c.first).pow(c.second);
    }
    out(ans.val());
}