n, m = map(int, input().split())
B = [(2 ** n - 1)] * n
A, A_c = [0] * m, [0] * m
for i in range(m):
    l, *a = map(int, input().split())
    for j in range(l):
        A[i] |= 1 << (a[j] - 1)
    A_c[i] = ~A[i]
    for j in range(n):
        if (A[i] >> j) & 1:
            B[j] &= A[i]
        else:
            B[j] &= A_c[i]

s = set()
for i in range(n):
    s.add(B[i])
print(pow(2, len(s), 998244353))