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():
    def dfs1(u):
        for v in to[u]:
            if vis[v]:continue
            vis[v]=True
            dfs1(v)
        topo.append(u)

    def dfs2(u):
        vis[u]=True
        res=[u]
        for v in ot[u]:
            if vis[v]:continue
            res+=dfs2(v)
        return res

    def dfs3(u):
        for v in to[u]:
            if kill[v]:continue
            kill[v]=True
            dfs3(v)

    to=defaultdict(list)
    ot=defaultdict(list)
    root=[True]*n
    for _ in range(m):
        g,r=MI()
        g-=1
        hh=LI1()
        for h in hh:
            to[h].append(g)
            ot[g].append(h)
        root[g]=False
    #print(to)
    #print(ot)
    topo=[]
    vis=[False]*n
    for u in range(n):
        if not root[u]:continue
        vis[u]=True
        dfs1(u)
    #print(topo)
    vis=[False]*n
    kill=[False]*n
    for u in topo[::-1]:
        if vis[u]:continue
        scc=dfs2(u)
        #print(scc)
        if len(scc)>1:
            for u in scc:
                kill[u]=True
    for u in range(n):
        if not kill[u]:continue
        dfs3(u)
    print(n-sum(kill))

n,m = MI()
main()