import sequtils
template times*(n:int,body) = (for _ in 0..<n: body)

proc getchar_unlocked():char {. importc:"getchar_unlocked",header: "<stdio.h>" .}
proc scan(): int =
  while true:
    let k = getchar_unlocked()
    if k < '0': break
    result = 10 * result + k.ord - '0'.ord

proc topologicalSort(E:seq[seq[int]],deleteIsolated:bool = false) : seq[int] =
  # E : [n->[m1,m2,m3], ... ]の隣接リスト を ソート
  var visited = newSeq[int](E.len)
  var tsorted = newSeq[int]()
  proc visit(node:int) =
    visited[node] += 1
    if visited[node] > 1: return
    for edge in E[node]: visit(edge)
    tsorted &= node # 葉から順に追加される
  for n in 0..<E.len: visit(n)
  if deleteIsolated: # 孤立点の除去
    result = tsorted.filterIt(visited[it] > 1 or E[it].len > 0)
  else: result = tsorted


let n = scan()
let m = scan()
var E = newSeqWith(n+1,newSeq[int]())
var IE = newSeqWith(n+1,newSeq[int]())
m.times:
  let g = scan()
  let r = scan()
  r.times:
    let h = scan()
    E[g] &= h
    IE[h] &= g
var bought = newSeq[bool](n+1)
var ans = 0
for e in E.topologicalSort():
  if e == 0 : continue
  if E[e].len == 0 or E[e].allIt(bought[it]):
    ans += 1
    bought[e] = true
echo ans