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