import sys
from itertools import permutations
import heapq

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

N,M = mi()
P = [i for i in range(N)]
for _ in range(M):
    t,*idx = mi()
    idx = [i-1 for i in idx]
    last = P[idx[-1]]
    for i in range(t-1)[::-1]:
        P[idx[i+1]] = P[idx[i]]
    P[idx[0]] = last

A = []
visit = [False] * N
for i in range(N):
    if visit[i]:
        continue
    n = 0
    stack = [i]
    visit[i] = True
    while stack:
        v = stack.pop()
        n += 1
        nv = P[v]
        if not visit[nv]:
            visit[nv] = True
            stack.append(nv)
    A.append(n)

M = 10**6
spf = [n for n in range(M+1)]
for p in range(2,M+1):
    if spf[p]!=p:
        continue
    for n in range(p,M+1,p):
        spf[n] = p

prime_pow = [0] * (M+1)
for a in A:
    while a!=1:
        p = spf[a]
        e = 0
        while a % p == 0:
            e += 1
            a //= p
        prime_pow[p] = max(prime_pow[p],e)

res = 1
for i in range(2,M+1):
    res *= pow(i,prime_pow[i],998244353)
    res %= 998244353

print(res)