#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

ll my_pow(ll x, ll n, ll mod) {
    // 　繰り返し二乗法．x^nをmodで割った余り．
    ll ret;
    if (n == 0) {
        ret = 1;
    } else if (n % 2 == 1) {
        ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod;
    } else {
        ret = my_pow((x * x) % mod, n / 2, mod);
    }
    return ret;
}

ll inv(ll x, ll mod) { return my_pow(x, mod - 2, mod); }

ll my_gcd(ll a, ll b) {
    ll ret = 0;
    if (a < b) {
        swap(a, b);
    }
    if (b == 0) {
        ret = a;
    } else {
        ret = my_gcd(b, a % b);
    }
    return ret;
}

int main() {
    ll N, M;
    cin >> N >> M;
    vector<ll> T(M);
    vector<vector<ll>> S(M, vector<ll>(0));
    for (ll i = 0; i < M; i++) {
        cin >> T[i];
        for (ll j = 0; j < T[i]; j++) {
            ll s;
            cin >> s;
            S[i].push_back(s - 1);
        }
    }
    vector<ll> final(N);
    for (ll i = 0; i < N; i++) {
        final[i] = i;
    }
    for (ll i = 0; i < M; i++) {
        vector<ll> nxt(T[i]);
        for (ll j = 0; j < T[i]; j++) {
            nxt[j] = final[S[i][(j + T[i] - 1) % T[i]]];
        }
        for (ll j = 0; j < T[i]; j++) {
            final[S[i][j]] = nxt[j];
        }
        // debug(nxt);
        // debug(final);
    }
    vector<ll> rings(0);
    vector<bool> isvisited(N, false);
    for (ll i = 0; i < N; i++) {
        ll cnt = 0;
        if (isvisited[i]) {
            continue;
        }
        ll now = i;
        while (true) {
            isvisited[now] = true;
            cnt++;
            if (final[now] == i) {
                break;
            }
            now = final[now];
        }
        rings.push_back(cnt);
    }
    ll lcm = 1;
    vector<ll> has(1000002, 0);
    for (ll i = 0; i < rings.size(); i++) {
        ll val = rings[i];
        for (ll j = 2; j * j <= val; j++) {
            ll count = 0;
            while (true) {
                if (val % j != 0) {
                    break;
                }
                val /= j;
                count++;
            }
            has[j] = max(has[j], count);
        }
        if (val != 1) {
            has[val] = max(has[val], 1LL);
        }
    }
    for (ll i = 2; i <= 1000001; i++) {
        for (ll j = 0; j < has[i]; j++) {
            lcm = (lcm * i) % mod2;
        }
    }
    cout << lcm << endl;
}