import sys

sys.setrecursionlimit(10 ** 6)
# from itertools import *
from bisect import *
# from math import *
from collections import *
from heapq import *
from random import *
from decimal import *
import numpy as np

int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def main():
    buy=(1<<n)-1
    gtob={}
    for _ in range(m):
        g,r=MI()
        g-=1
        hh=LI1()
        bit=sum(1<<h for h in hh)
        gtob[g]=bit
        buy-=1<<g
    while gtob:
        nxt={}
        update=False
        for g,bit in gtob.items():
            if bit&buy==bit:
                buy|=1<<g
                update=True
            else:
                nxt[g]=bit
        gtob=nxt
        if not update:break
    print(n-len(gtob))

n,m = MI()
main()