output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N K
      d_1
      A_{1, 1} \cdots A_{1, d_1}
      \vdots
      d_K
      A_{K, 1} \cdots A_{K, d_K}
attempt: a, b = map(int, input().split())
  lis = [0] * a
  for i in range(b):
      p = int(input())
      t = map(int, input().split())
      for j in t:
          lis[j - 1] = 1
  for i in lis:
      a -= i
  print(a)
  
problem_description: Statement
  
  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 Snack i: Snuke A_{i, 1}, A_{i, 2},
  \cdots, A_{i, {d_i}}.
  
  Takahashi 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?
samples: [{"input": "3 2\n    2\n    1 3\n    1\n    3", "output": "1\n    \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.\n\n* * *"}, {"input": "3 3\n    1\n    3\n    1\n    3\n    1\n    3", "output": "2"}]