import java.util.Arrays;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        int[] D = new int[K];
        int[] A = new int[N + 1];
        Arrays.fill(A, 0);

        int count = 0;
        for (int j = 0; j < K; j++) {
            D[j] = sc.nextInt();
            for (int i = 0; i < D[j]; i++) {
                int sunuke = sc.nextInt();
                if (A[sunuke] == 0) {
                    A[sunuke]++;
                    count++;
                }
            }
        }
        sc.close();

        System.out.println(N - count);

    }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz