{"problem":{"name":"Trick or Treat","description":{"content":"$N$ _Snukes_ called Snuke $1$, Snuke $2$, ..., Snuke $N$ live in a town. There are $K$ kinds of snacks sold in this town, called Snack $1$, Snack $2$, ..., Snack $K$. The following $d_i$ Snukes have S","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc166_b"},"statements":[{"statement_type":"Markdown","content":"$N$ _Snukes_ called Snuke $1$, Snuke $2$, ..., Snuke $N$ live in a town.\nThere are $K$ kinds of snacks sold in this town, called Snack $1$, Snack $2$, ..., Snack $K$. The following $d_i$ Snukes have Snack $i$: Snuke $A_{i, 1}, A_{i, 2}, \\cdots, A_{i, {d_i}}$.\nTakahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief?\n\n## Constraints\n\n*   All values in input are integers.\n*   $1 \\leq N \\leq 100$\n*   $1 \\leq K \\leq 100$\n*   $1 \\leq d_i \\leq N$\n*   $1 \\leq A_{i, 1} < \\cdots < A_{i, d_i} \\leq N$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $K$\n$d_1$\n$A_{1, 1} \\cdots A_{1, d_1}$\n$\\vdots$\n$d_K$\n$A_{K, 1} \\cdots A_{K, d_K}$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc166_b","tags":[],"sample_group":[["3 2\n2\n1 3\n1\n3","1\n\n*   Snuke $1$ has Snack $1$.\n*   Snuke $2$ has no snacks.\n*   Snuke $3$ has Snack $1$ and $2$.\n\nThus, there will be one victim: Snuke $2$."],["3 3\n1\n3\n1\n3\n1\n3","2"]],"created_at":"2026-03-03 11:01:14"}}