import sys
input = sys.stdin.readline

def rot(P, T):
    M = T.pop(0)
    temp = dict()
    for i in range(M):
        temp[T[(i + 1)%M] - 1] = P[T[i] - 1]
    for k, v in temp.items():
        P[k] = v
    return P


class UnionFind(object):
    def __init__(self, n=1):
        self.par = [i for i in range(n)]
        self.rank = [0 for _ in range(n)]
        self.size = [1 for _ in range(n)]

    def find(self, x):
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x != y:
            if self.rank[x] < self.rank[y]:
                x, y = y, x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
            self.par[y] = x
            self.size[x] += self.size[y]

    def is_same(self, x, y):
        return self.find(x) == self.find(y)

    def get_size(self, x):
        x = self.find(x)
        return self.size[x]



N, M = map(int, input().split())
mod = 998244353
P = list(range(N))
for _ in range(M):
    S = list(map(int, input().split()))
    P = rot(P, S)
    
U = UnionFind(N)
for i in range(N):
    U.union(i, P[i])
    
SS = set()
from math import gcd
ans = 1
for i in range(N):
    if U.find(i) in SS:
        continue
    SS.add(U.find(i))
    ans = (ans * U.get_size(i))//gcd(ans, U.get_size(i))
    
print(ans%mod)