

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[] count = new int[n];
		for(int i = 0;i < n;i++) {
			count[i] = 0;
		}

		for(int j = 0;j < k;j++) {
			int[] d = new int[k];
			d[j] = sc.nextInt();
			int[] a = new int[d[j]];
			for(int i = 0;i < d[j];i++) {
				a[i] = sc.nextInt();
				for(int q = 0;q < n;q++) {
					if(a[i] == q+1) {
						count[q] = 1;
					}
				}
			}

		}


		int totalcount = 0;
		for(int i = 0;i < n;i++) {
			if(count[i] == 0) {
				totalcount++;
			}
		}

		System.out.println(totalcount);

	}
}

/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