import java.util.ArrayList;
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;
		A = new int[K][];
		
		for(int i=0; i<K; i++) {
		    d[i] = s.nextInt();
		    A[i] = new int[d[i]];
			for(int k=0; k<d[i]; k++) {
				A[i][k] = s.nextInt();
			}
			
		}
		ArrayList<Integer> sunukes = new ArrayList<Integer>();
		for(int i=0; i<K; i++) {
			for(int k=0; k<d[i]; k++) {
				if(sunukes.contains(A[i][k])) {}
				else {sunukes.add(A[i][k]);}
			}
		}
		int ans = N - sunukes.size();
		System.out.println(ans);
	}

}

/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