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

int main() {
	int N, M;
	cin >> N >> M;
	vector<int> A(N);
	iota(A.begin(), A.end(), 0);
	for (int i = 0; i < M; i++){
		int T;
		cin >> T;
		vector<int> S(T);
		for (int j = 0; j < T; j++){
			cin >> S[j];
			S[j]--;
		}
		vector<int> B(T);
		for (int j = 0; j < T; j++){
			B[j] = A[S[j]];
		}
		for (int j = 0; j < T; j++){
			A[S[j]] = B[(j - 1 + T) % T];
		}
	}
	atcoder::dsu uf(N);
	for (int i = 0; i < N; i++){
		uf.merge(i, A[i]);
	}
	mint ans = 1;
	map<int, int> p;
	for (auto s : uf.groups()){
		int k = s.size();
		vector<int> C(k + 1);
		for (int i = 2; i <= k; i++){
			for (int j = i; j <= k; j += i){
				C[j]++;
			}
		}
		for (int i = 2; i <= k; i++){
			if (C[i] == 1){
				int k2 = k;
				int c = 0;
				while (k2 % i == 0){
					k2 /= i;
					c++;
				}
				p[i] = max(p[i], c);
			}
		}
	}
	for (auto [k, v] : p){
		ans *= mint(k).pow(v);
	}
	cout << ans.val() << '\n';
}