package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

func configure(scanner *bufio.Scanner) {
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 1000005), 1000005)
}
func getNextString(scanner *bufio.Scanner) string {
	scanned := scanner.Scan()
	if !scanned {
		panic("scan failed")
	}
	return scanner.Text()
}
func getNextInt(scanner *bufio.Scanner) int {
	i, _ := strconv.Atoi(getNextString(scanner))
	return i
}
func getNextInt64(scanner *bufio.Scanner) int64 {
	i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
	return i
}
func getNextFloat64(scanner *bufio.Scanner) float64 {
	i, _ := strconv.ParseFloat(getNextString(scanner), 64)
	return i
}
func main() {
	fp := os.Stdin
	wfp := os.Stdout
	extra := 0
	if os.Getenv("I") == "IronMan" {
		fp, _ = os.Open(os.Getenv("END_GAME"))
		extra = 100
	}
	scanner := bufio.NewScanner(fp)
	configure(scanner)
	writer := bufio.NewWriter(wfp)
	defer func() {
		r := recover()
		if r != nil {
			fmt.Fprintln(writer, r)
		}
		writer.Flush()
	}()
	solve(scanner, writer)
	for i := 0; i < extra; i++ {
		fmt.Fprintln(writer, "-----------------------------------")
		solve(scanner, writer)
	}
}
func solve(scanner *bufio.Scanner, writer *bufio.Writer) {
	n := getNextInt(scanner)
	m := getNextInt(scanner)
	g := newGraph(n)
	rr := make([]rule, m)
	pp := make([]*rule, n)
	for i := 0; i < m; i++ {
		rr[i].g = getNextInt(scanner) - 1
		rr[i].r = getNextInt(scanner)
		rr[i].hh = make([]int, rr[i].r)
		for j := 0; j < rr[i].r; j++ {
			rr[i].hh[j] = getNextInt(scanner) - 1
			g.AppendEdge(rr[i].hh[j], rr[i].g, 0)
		}
		pp[rr[i].g] = &rr[i]
	}
	tana := make([]int, n)
	for i := 0; i < n; i++ {
		mn := n
		mi := -1
		for j := 0; j < n; j++ {
			if mn > g.v[j].deg {
				mn = g.v[j].deg
				mi = j
			}
		}
		tana[i] = mi
		for _, e := range g.e[mi] {
			if g.v[e.to].deg < n {
				g.v[e.to].deg--
			}
		}
		g.v[mi].deg = n
	}
	var ans int
	taken := map[int]bool{}
	for i := 0; i < n; i++ {
		p := pp[tana[i]]
		if p == nil {
			ans++
			taken[tana[i]] = true
			continue
		}
		exists := func() bool {
			for _, h := range p.hh {
				if taken[h] == false {
					return false
				}
			}
			return true
		}
		if exists() {
			ans++
			taken[tana[i]] = true
		}
	}
	fmt.Fprintln(writer, ans)
}

type rule struct {
	g, r int
	hh   []int
}
type vertex struct {
	deg int
}
type edge struct {
	to, id int
}
type graph struct {
	v []vertex
	e [][]edge
}

func newGraph(n int) graph {
	return graph{
		v: make([]vertex, n),
		e: make([][]edge, n),
	}
}
func (g *graph) AppendEdge(from, to, id int) {
	g.e[from] = append(g.e[from], edge{
		to: to,
		id: id,
	})
	g.v[to].deg++
}