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

mask = (1 << n) - 1
base = [mask]

for i in range(m):
	l = list(map(int,input().split()))
	v = 0
	for j in range(1, l[0]+1):
		v ^= 1 << (l[j] - 1)
	w = mask ^ v
	for e in base:
		v = min(v, v ^ e)
	if v: base.append(v)
	for e in base:
		w = min(w, w ^ e)
	if w: base.append(w)

mod = 998244353
print(pow(2, len(base), mod))