import math

def lcm(a, b):
    return a * b // math.gcd(a, b)

def main():
    n, m = map(int, input().split())
    vec = list(range(n))
    
    for _ in range(m):
        input_data = list(map(int, input().split()))
        t = input_data[0]
        rol = list(map(lambda x: int(x) - 1, input_data[1:]))
        rol.reverse()
        x = vec[rol[0]]
        for j in range(t - 1):
            vec[rol[j]] = vec[rol[j + 1]]
        vec[rol[t - 1]] = x
        
    ans = 1
    che = [0] * n
    for i in range(n):
        if che[i] == 1:
            continue
        x = vec[i]
        sum_val = 0
        while True:
            sum_val += 1
            che[x] = 1
            if vec[x] == i:
                break
            x = vec[x]
        if sum_val == 1:
            continue
        ans = lcm(ans, sum_val + 1)
    
    mod = 998244353
    print(ans % mod)

if __name__ == "__main__":
    main()