n,m = map(int,input().split())
mask = (1<<n) - 1
v = [mask] * n
for i in range(m):
	l = list(map(int,input().split()))
	a = 0
	w = [0] * n
	for j in range(1, l[0] + 1):
		a ^= 1 << (l[j]-1)
		w[l[j]-1] += 1
	b = mask ^ a
	for j in range(n):
		if w[j] == 1:
			v[j] &= a
		else:
			v[j] &= b

print(pow(2,len(set(v)),998244353))