"""

https://yukicoder.me/problems/no/2134

"""

import sys
from sys import stdin

def uf_find(n,p):

    ufl = []

    while p[n] != n:
        ufl.append(n)
        n = p[n]

    for i in ufl:
        p[i] = n

    return n


def uf_union(a,b,p,rank):

    ap = uf_find(a,p)
    bp = uf_find(b,p)

    if ap == bp:
        return True
    else:

        if rank[ap] > rank[bp]:
            p[bp] = ap
        elif rank[ap] < rank[bp]:
            p[ap] = bp
        else:
            p[bp] = ap
            rank[ap] += 1

        return False

N,M = map(int,stdin.readline().split())

lis = [ [0] * N for i in range(N) ]

for loop in range(M):

    a = list(map(int,stdin.readline().split()))[1:]
    for i in range(len(a)):
        a[i] -= 1
    a = set(a)

    b = []

    for i in range(N):
        if i not in a:
            b.append(i)

    for i in a:
        for j in b:
            lis[i][j] = lis[j][i] = 1

p = [i for i in range(N)]
rank = [0] * N

for i in range(N):
    for j in range(i):

        if lis[i][j] == 0:
            uf_union(i,j,p,rank)

part = 0
for i in range(N):
    if uf_find(i,p) == i:
        part += 1

print (pow(2,part,998244353))