import java.util.*;
import java.util.function.*;
import java.math.*;
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 = 0;
		boolean[] have = new boolean[N];
		for(int i = 0; i < K;i++) {
			d = s.nextInt();
			for(int j = 0; j < d; j++) {
				have[s.nextInt() - 1] = true;
			}
		}
		
		int counter = 0;
		for(boolean b : have) {
			if(b)
				continue;
			counter++;
		}
		
		System.out.println(counter);
    }
}
/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