{"raw_statement":[{"iden":"problem statement","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?"},{"iden":"constraints","content":"*   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$"},{"iden":"input","content":"Input 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}$"},{"iden":"sample input 1","content":"3 2\n2\n1 3\n1\n3"},{"iden":"sample output 1","content":"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$."},{"iden":"sample input 2","content":"3 3\n1\n3\n1\n3\n1\n3"},{"iden":"sample output 2","content":"2"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}