// (⁠◕⁠ᴗ⁠◕⁠✿⁠)
 
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define srep(i, s, n) for (ll i = s; i < (n); i++)
#define len(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
using vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;
using ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;
using uint = unsigned int;
using ull = unsigned long long;
const double pi = 3.141592653589793;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
// const ll mod = 1000000007;
const ll mod = 998244353;
inline bool inside(long long y, long long x, long long H, long long W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }

#define debug(var)  do{std::cout << #var << " : \n";view(var);}while(0)
template<typename T> void view(T e){cout << e << endl;}
template<typename T> void view(const vc<T>& v){for(const auto& e : v){ cout << e << " "; } cout << endl;}
template<typename T> void view(const vv<T>& vv){ for(const auto& v : vv){ view(v); } }


int main(){
    int N, M; cin >> N >> M;
    vi now(N); rep(i, N) now[i] = i;
    rep(i, M){
        int t; cin >> t;
        vi S(t); rep(j, t) cin >> S[j];
        rep(j, t) S[j]--;
        rep(j, t) now[S[j]] = S[(j + 1) % t];
    }
    vc<bool> seen(N, false);
    vl res;
    rep(i, N){
        if (seen[i]) continue;
        int id = i, cnt = 0;
        while (!seen[id]){
            seen[id] = true;
            id = now[id];
            cnt++;
        }
        res.push_back(cnt);
    }
    ll g = res[0];
    for (auto x : res) g = gcd(g, x);
    rep(i, len(res)) res[i] /= g;
    ll ret = 1;
    for (auto x : res){
        ret *= x;
        ret %= mod;
    }
    cout << ret << endl;
}