MOD = 998244353

n, m = map(int, input().split())

# Read each A_i and store as a set for quick look-up
a_sets = []
for _ in range(m):
    parts = list(map(int, input().split()))
    l_i = parts[0]
    elements = parts[1:]
    a_set = set(elements)
    a_sets.append(a_set)

# For each element x in X, generate its feature tuple
seen = set()
for x in range(1, n+1):
    # Check membership in each of the a_sets
    features = tuple((x in a_set) for a_set in a_sets)
    seen.add(features)

k = len(seen)
result = pow(2, k, MOD)
print(result)