#include<bits/stdc++.h>
#include<atcoder/modint>
using namespace std;
using mint = atcoder::modint998244353;

int main(){
    int n, m; cin >> n >> m;
    vector<int> p(n); iota(p.begin(),p.end(),0);
    while (m--){
        int t; cin >> t;
        vector<int> q(t);
        for (int i = 0; i < t; i++) cin >> q[i], q[i]--;
        reverse(q.begin(),q.end());
        for (int i = 0; i < t-1; i++) swap(p[q[i]],p[q[i+1]]);
    }
    
    vector<bool> done(n,false);
    vector<int> ma(n+1,0);
    for (int i = 0; i < n; i++){
        if (done[i]) continue;
        int len = 1;
        int cur = p[i];
        done[i] = true;
        while (i != cur){
            len++;
            done[cur] = true;
            cur = p[cur];
        }
        for (int d = 2; d * d <= len; d++){
            if (len % d != 0) continue;
            int cnt = 0;
            while (len % d == 0){
                len /= d;
                cnt++;
            }
            ma[d] = max(ma[d],cnt);
        }
        ma[len] = max(ma[len],1);
    }
    mint ans = 1;
    for (int len = 1; len <= n; len++){
        ans *= mint(len).pow(ma[len]);
    }
    cout << ans.val() << endl;
}