Problem:
 Score : 200 points    Problem 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?      Constraints  All values in input are integers.  1 \leq N \leq 100  1 \leq K \leq 100  1 \leq d_i \leq N  1 \leq A_{i, 1} < \cdots < A_{i, d_i} \leq N         Input 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}       Output Print the answer.        Sample Input 1 3 2
2
1 3
1
3      Sample Output 1 1   Snuke 1 has Snack 1 .  Snuke 2 has no snacks.  Snuke 3 has Snack 1 and 2 .   Thus, there will be one victim: Snuke 2 .       Sample Input 2 3 3
1
3
1
3
1
3      Sample Output 2 2

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    AtoZ = list('abcdefghijklmnopqrsruvwxyz')
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    
        
        
            
            
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    
    
    N, K = R()
    l = [0] * N
    for i in range(K):
        _ = r_int()
        A = R()
        for a in A:
            l[a-1] += 1
    ans = 0
    for ll in l:
        if ll == 0:
            ans += 1
    print(ans)

    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Solution (Python):
from collections import Counter
n, k = map(int, input().split())
counter = Counter()
for _ in range(k):
    d = input()
    counter.update(Counter(input().split()))
print(sum([1 for i in range(n) if counter[str(i+1)]==0]))

Solution (Python):
N, K = map(int, input().split(" "))
snuke = set()
for _ in range(K) :
    _ = input()
    for i in input().split(" ") :
        snuke.add(i)

print( N - len(snuke))

Solution (Python):
n,k=map(int,input().split())
S=[0]*n

for _ in range(k):
	d=int(input())
	A=list(map(int,input().split()))
	for a in A:
		S[a-1]+=1

res=0
for i in range(n):
	if S[i]==0:
		res+=1

print(res)

Solution (Python):
N,K=map(int,input().split())
ans=set()
for i in range(K):
    d=int(input())
    A=list(map(int,input().split()))
    for j in range(len(A)):
        ans.add(A[j])
print(N-len(ans))

Solution (Python):
from collections import defaultdict

def main():
    N, K = map(int, input().split())
    d = [0] * K
    A = [[] for _ in range(K)]
    B = defaultdict(int)
    for i in range(K):
        d[i] = int(input())
        A[i] = list(map(int, input().split()))
        for a in A[i]:
            B[a] += 1
    ans = 0
    for i in range(1,N+1):
        if B[i] == 0:
            ans += 1
    print(ans)



if __name__ == "__main__":
    main()

Solution (Python):
import sys
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    N, K = map(int, input().split())
    have = [0]*N
    for _ in range(K):
        d = int(input())
        A = list(map(int, input().split()))
        for a in A:
            have[a-1]=1
    print(N-sum(have))

if __name__ == '__main__':
    main()

Solution (Python):

N, K = map(int, input().split())
no_okashi = set(range(1, N+1))

for _ in range(K):
  num_hito = int(input())
  has_okashi = set(map(int, input().split()))
  no_okashi = no_okashi - has_okashi
  
print(len(no_okashi))

Solution (Python):
N, K = map(int, input().split())
d = []
A = []
for k in range(K):
    d.append(int(input()))
    A += list(map(int, input().split()))

print(N - len(set(A)))

Solution (Python):
import sys
input = sys.stdin.readline
def main():
    N, K = map(int, input().split())
    a = set()
    for _ in range(K):
        d = int(input())
        A = list(map(int, input().split()))
        for Ai in A:
            a.add(Ai)
    print(N-len(a))
if __name__ == "__main__":
    main()

Solution (Python):
n,k = map(int,input().split())
A = set([i for i in range(1,n+1)])
B = set()
for _ in range(k):
    input()
    tmp = list(map(int,input().split()))
    B = B | set(tmp)
ans = A-B
print(len(ans))

Solution (Python):
n,k = map(int, input().split())
l = []
for i in range(k):
    d = int(input())  
    a = list(map(int, input().split()))
    for i in a:
        l.append(i)

l = set(l)
print(n-len(l))

Solution (Python):
N, K = map(int, input().split())

c = [0] * (N+1)
for i in range(K):
    d = int(input())
    A = list(map(int, input().split()))
    for a in A:
        c[a] += 1
ans = sum(x == 0 for x in c) - 1
print(ans)

Solution (Python):
N, K = map(int, input().split())

li = [0] * N
for k in range(K):
    _ = input()
    A = list(map(int, input().split()))
    for a in A:
        li[a - 1] += 1

ans = 0
for i in range(N):
    if li[i] == 0:
        ans += 1

print(ans)

Solution (Python):
n, k = map(int, input().split())
snuke = [0] * (n+1)
for i in range(k):
    d = int(input())
    a = list(map(int, input().split()))
    for j in a:
        snuke[j] += 1

ans = 0
for i in range(1, n+1):
    if snuke[i] == 0:
        ans += 1

print(ans)

Solution (Python):
import sys

n, k = map(int, input().split())

x = set()

for i in range(k):
	d = int(input())
	a = list(map(int, input().split()))

	for s in a: 
		x.add(s)
result = 0

for i in range(1, n + 1):
	if not i in x:
		result += 1

print(result)

Solution (Python):
N,K = map(int,input().split())
A = []
Ns = set([_ for _ in range(1,N+1)])
for i in range(K):
    d = int(input())
    A = A+list(map(int,input().split()))
s = set(A)
print(len(Ns-s))

Solution (Python):
n, k = map(int, input().split())
ans = {}
for _ in range(k):
    d = int(input())
    a = list(map(int, input().split()))
    for aa in a:
        if aa not in ans:
            ans[aa] = True

print(n - len(ans))

Solution (Python):
N, K = list(map(int, input().split()))
cnt = {}
for i in range(1, N+1):
    cnt[i] = 0
for _ in range(K):
    d = int(input())
    arr = list(map(int, input().split()))
    for a in arr:
        cnt[a] += 1
ans = 0
for k in cnt:
    if cnt[k] == 0:
        ans+=1
print(ans)

Solution (Python):
N, K = map(int, input().split())
s = set()

for _ in range(K):
    d = int(input())
    for a in list(map(int, input().split())):
        s.add(a)

print(N - len(s))

Solution (Python):
n,k=map(int,input().split())
a = [0 for i in range(n)]
for i in range(k):
    d = int(input())
    for i in list(map(int,input().split())):
        a[i-1]+=1
print(a.count(0))

Solution (Python):
N, K = map(int, input().split())

cnt = [0] * N
for i in range(K):
    d = int(input())
    A = list(map(int, input().split()))
    for j in A:
        cnt[j-1] += 1

ans = 0
for i in cnt:
    if i == 0:
        ans += 1

print(ans)

Solution (Python):
n, k = map(int, input().split())
a = [0 for i in range(n)]
for i in range(k):
    d = int(input())
    aa = list(map(int, input().split()))
    for i in aa:
        a[i-1] += 1

ans = 0
for i in range(n):
    if a[i-1] == 0:
        ans += 1

print(ans)

Solution (Python):
N, K = list(map(int,input().split()))
A = list([0]*(N+1))
for i in range(K):
  m = input()
  lst = list(map(int,input().split()))
  for d in lst:
    A[d]+=1
    
ans=0
for a in A[1:]:
  if a==0:
    ans+=1
    
print(ans)

Solution (Python):
def read_int():
    return int(input())

def read_int_map():
    return map(int,input().split(' '))

def read_int_list():
    return list(map(int,input().split(' ')))

def read_s_list_loop(n):
    return [input() for _ in range(n)]

N,K = read_int_map()
human = [1]*N
for i in range(K):
    d = read_int()
    An = read_int_list()
    for a in An:
        human[a-1] = 0
print(sum(human))

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():

    n,k=map(int,input().split())
    c=[False]*n
    for i in range(k):
        d=int(input())
        A=list(map(int,input().split()))
        for j in A:
            if c[j-1]==False:
                c[j-1]=True
    print(n-sum(c))



resolve()

Solution (Python):
N, K = map(int, input().split())
H = [False] * N

for _ in range(K):
    d = int(input())
    A = map(int, input().split())
    for a in A:
        H[a-1] = True

ans = 0
for h in H:
    if not h:
        ans += 1

print(ans)

Solution (Python):
n,k = map(int,input().split())
snack = [0 for _ in range(n)]
for _ in range(k):
  d = int(input())
  A = list(map(int,input().split()))
  for a in A:
    snack[a-1] += 1
ans = 0
for snk in snack:
  if snk == 0:
    ans += 1
print(ans)

Solution (Python):
N,K = (int(i) for i in input().split())

A = [0] * N

for k in range(K):
  d = int(input())
  A_tmp = [int(i) for i in input().split()]
  for a in A_tmp:
    A[a-1] += 1

ans = 0

for a in A:
  if a == 0:
    ans += 1

print(ans)

Solution (Python):
N, K = map(int, input().split())
dicts = {i:False for i in range(N)}
for i in range(K):
    d = int(input())
    for j in map(lambda n:int(n) - 1, input().split()):
        dicts[j] = True
        
ans = 0
for i in range(N):
    if not dicts[i]:
        ans += 1

print(ans)

Solution (Python):
N,K = map(int,input().split())
L = []
for i in range(K):
  d = input()
  L += list(map(int,input().split()))

l = set(L)

print(N -len(l))

Solution (Python):
N,K = map(int, input().split())
d = []
A = []
ans = [0]*N
for i in range(K):
    d.append(int(input()))
    a = list(map(int, input().split()))
    for j in a:
        ans[j - 1] = 1
print(ans.count(0))

Solution (Python):
n,k=map(int,input().split())
s=set()
for i in range(k):
  _=input()
  s|=set(input().split())
print(n-len(s))

Solution (Python):
N,K=map(int,input().split(' '))
h = []
for i in range(K):
    d = int(input())
    l = list(map(int,input().split(' ')))
    for j in l:
        h.append(j)
print(N-len(list(set(h))))

Solution (Python):
N,K = map(int, input().split())

dic = {}

for i in range(N):
    dic[i] = 0

for _ in range(K):
    d  = int(input())
    A  = map(int, input().split())
    for a in A:
        a = a - 1
        if dic[a]!=0:
            dic[a] += 1
            continue
        dic[a] = 1


ans = 0
for key in dic:
    if dic[key]==0:
        ans = ans + 1

print(ans)

Solution (Python):
n, k = map(int, input().split())
sunuke = [0] * n
for _ in range(k):
    d = int(input())
    a_li = list(map(int, input().split()))
    for a in a_li:
        sunuke[a - 1] += 1
print(sunuke.count(0))

Solution (Python):
from collections import defaultdict
dd = defaultdict(lambda:0)
n, k = map(int, input().split())
for _ in range(k):
    d = int(input())
    li_a = list(map(int, input().split()))
    for i in li_a:
        dd[i] += 1
sum_ = 0    
for key in dd:
    sum_ += 1
print(n-sum_)

Solution (Python):
N, K = map(int, input().split())
trick = [1] * N
for k in range(K):
    d = int(input())
    A = [int(i) for i in input().split()]
    for a in A:
        trick[a - 1] = 0
print(sum(trick))

Solution (Python):
n,k=map(int,input().split())
s=set()
for _ in range(k):
  d=int(input())
  a=set(map(int,input().split()))
  s|=a
print(n-len(s))

Solution (Python):
N, K = map(int, input().split())
d = []
A = []

for _ in range(K):
    d.append(int(input()))
    A.append(list(map(int, input().split())))

cnt = {}
for i in range(N):
    cnt.setdefault(str(i + 1), 0)

for Ai in A:
    for Aij in Ai:
        cnt[str(Aij)] += 1

ans = 0
for key, val in cnt.items():
    if val == 0: ans += 1

print(ans)

Solution (Python):
n,k=map(int,input().split())
ans=[1]*n
for i in range(k):
    d=int(input())
    a=list(map(int,input().split()))
    for j in range(d):
        ans[a[j]-1]=0
print(sum(ans))

Solution (Python):
n,k=map(int,input().split())
A=[]
List=[0]*n
d=[0]*k
for i in range(k):
    d[i]=int(input())
    A.append(list(map(int,input().split())))
    for j in range(d[i]):
        if (List[A[i][j]-1]==0):
            List[A[i][j]-1]=1
    
print(n-sum(List))

Solution (Python):
n, k = map(int, input().split())
dlis = []
Alis = []
for i in range(k):
    dlis.append(int(input()))
    Alis.append(list(map(int, input().split())))
lis = [0]*n
for i in range(k):
    for a in Alis[i]:
        lis[a-1] += 1
print(lis.count(0))

Solution (Python):
N, K = list(map(int, input().split()))

rest = [1] * N

for i in range(K):
  _ = int(input())
  A = list(map(int, input().split()))
  for a in A:
    rest[a - 1] = 0

print(sum(rest))

Solution (Python):
n,k=map(int,input().split())
l=set()
for i in range(k):
    d=int(input())
    s=list(map(int, input().split()))
    for j in s:
        l.add(j)

a=n-len(l)



print(a)

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    N,K=map(int,input().split())
    s=set()
    for _ in range(K):
        _=input()
        A=set(map(int,input().split()))
        s=s.union(A)
    print(N-len(s))

if __name__ == '__main__':
    main()

Solution (Python):
n, k = map(int, input().split())

not_have = [True] * n

for _ in range(k):
    d = int(input())
    A = list(map(int, input().split()))

    for a in A:
        not_have[a-1] = False

print(sum(not_have))

Solution (Python):
N,K=map(int,input().split())
arr=[0]*N
for _ in range(K):
    d=int(input())
    A=list(map(int,input().split()))
    for a in A:
        arr[a-1]=1
print(N-sum(arr))

Solution (Python):
n, k = map(int, input().split())
snuke = [True] * n
for _ in range(k):
  d = int(input())
  for a in map(int, input().split()):
    snuke[a-1] = False
print(sum(snuke))

Solution (Python):
def resolve():
    N, K = map(int, input().split())
    arr = [0] * N
    for _ in range(K):
        input()
        for num in list(map(int, input().split())):
            arr[num-1] = 1
    print(arr.count(0))

resolve()

Solution (Python):
n,k=map(int,input().split())

s=set()
for i in range(k):
    d=int(input())
    a1=list(map(int,input().split()))
    for j in range(d):
        s.add(a1[j])

print(n-len(s))

Solution (Python):
n,k=map(int,input().split())
snk=[0]*n
for i in range(k):
	d=int(input())
	a=list(map(int,input().split()))
	for i in a:
		snk[i-1]+=1
cnt=0
for i in snk:
	if i==0:
		cnt+=1
print(cnt)

Solution (Python):

import sys
import math
import itertools
import collections


def solve(N,K,D,A):
    ans = []
    for a in A:
        for n in a:
            ans.append(n)
    
    return N - len(set(ans))
def main():
    N,K = map(int,input().split())
    D = []
    A = []
    for _ in range(K):
        D.append(int(input()))
        A.append(list(map(int,input().split())))

    
    print(solve(N,K,D,A))

if __name__ == "__main__":
    main()

Solution (Python):
n,k=map(int,raw_input().split())
a=[0]*(n+1)
for i in range(k):
    d=input()
    b=map(int,raw_input().split())

    for j in range(d):
        a[b[j]]=1

    
a[0]=1
c=0
for i in range(len(a)):
    if a[i]==0:
        c+=1
print c

Solution (Python):
import sys
from math import factorial
from collections import Counter
from fractions import Fraction
import heapq, bisect, fractions
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
MOD = 10**9 + 7

n, k = MAP()
have = set([])
for i in range(k):
    d = INT()
    a = LIST()
    have = set(list(have) + a)
print(n - len(have))

Solution (Python):
import sys
import collections

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


def main():
    N, K = [int(x) for x in input().split()]
    c = collections.Counter()
    for _ in range(K):
        D = int(input())
        A = [int(x) for x in input().split()]
        for a in A:
            c[a] += 1

    ans = 0
    for i in range(1, N + 1):
        if c[i] == 0:
            ans += 1

    print(ans)

        


if __name__ == '__main__':
    main()

Solution (Python):
n,k = map(int, input().split())
snu = [0]*(n+1)
for i in range(k):
    d = int(input())
    a = list(map(int, input().split()))
    for su in a:
        if snu[su] == 0:
            snu[su] = 1
ans = snu.count(0) -1
print(ans)

Solution (Python):
from collections import Counter
n, k = map(int, input().split())
a = [0]*(n+1)
a[0] = 1
for _ in range(k):
    _ = input()
    d = list(map(int, input().split()))
    for di in d:
        a[di] += 1
cnt = Counter(a)
if 0 in cnt:
    print(cnt[0])
else:
    print(0)

Solution (Python):
n, k = map(int, input().split())

ans = {i for i in range(1, n + 1)}
for _ in range(k):
    d = int(input())
    ans -= set(map(int, input().split()))
print(len(ans))

Solution (Python):
N, K = map(int, input().split())
cnt = [0] * N
for i in range(K):
    d = int(input())
    A = list(map(int, input().split()))
    for j in range(d):
        cnt[A[j]-1] += 1
ans = 0
for i in range(N):
    if cnt[i] == 0:
        ans += 1
print(ans)

Solution (Python):
n, k = map(int, input().split())
listS = [0]*n
for i in range(k):
    d = int(input())
    A = list(map(int, input().split()))
    for a in A:
        listS[a-1] = 1
count = 0
for s in listS:
    if s!=1:
        count+=1
print(count)

Solution (Python):
N, K = map(int,input().split())
S = set()
for _ in range(K):
    d = int(input())
    A = list(map(int,input().split()))
    for a in A:
        S.add(a)
print(N - len(S))

Solution (Python):
a,b=map(int,input().split())
s=set([])
for i in range(b):
  d=int(input())
  l=list(map(int,input().split()))
  for x in l:
    s.add(x)
print(a-len(s))

Solution (Python):
N, K = map(int, input().split())
d = []
A = []
for i in range(K):
    d.append(int(input()))
    A += [*list(map(int, input().split()))]
print(N - len(set(A)))

Solution (Python):
N, K = map(int, input().split())

sunuke = [0] * N

for i in range(K):
    input()
    has_okashi = list(map(int, input().split()))

    for i in has_okashi:
        sunuke[i - 1] += 1

print(sunuke.count(0))

Solution (Python):
def main():
    N, K = (int(_) for _ in input().split())
    snuke = set(range(1, N+1))
    okashi = []
    for _ in range(K):
        d = int(input())
        okashi += [int(_) for _ in input().split()]
    snuke = snuke - set(okashi)
    print(len(snuke))
    return



if __name__ == '__main__':
    main()

Solution (Python):
n,k = map(int, input().split())

candy = []
for i in range(k):
    d = int(input())
    l = [int(x) for x in input().split(' ')]
    candy += l
    
candy_set = set(candy)

print(n - len(candy_set))

Solution (Python):
n, k = map(int, input().split())

arr = [[False] * k for _ in range(n)] 

for i in range(k):
    m = int(input())
    for p in map(int, input().split()):
        arr[p-1][i] = True

total = 0
for i in range(n):
    if not any(arr[i]):
        total += 1

print(total)

Solution (Python):
n, k = [int(elem) for elem in input().split()]
sunukes = [0] * n
for i in range(k):
    d = int(input())
    a_lst = [int(elem) for elem in input().split()]
    for j in a_lst:
        sunukes[j-1] += 1

print(sunukes.count(0))

Solution (Python):
import sys
input = sys.stdin.readline
from collections import defaultdict
N, K = map(int, input().split())
count = defaultdict(int)
for _ in range(K):
    d = int(input().rstrip())
    A = list(map(int, input().split()))
    for a in A:
        count[a-1] += 1
ans = 0
for i in range(N):
    if count[i] == 0:
        ans += 1
print(ans)