import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int N = s.nextInt();
        int K = s.nextInt();
        int d[] = new int[K];
        int A[] = new int[N];

        for (int i = 0; i < K; i++) {
            d[i] = s.nextInt();
            for (int j = 0; j < d[i]; j++) {
                int num = s.nextInt();
                A[num - 1] = 1;
            }
        }

        int count = 0;
        for (int i = 0; i < N; i++) {
            if (!(A[i] == 1)) {
                count++;
            }
        }
        System.out.println(count);

        s.close();
    }
}
/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