import java.util.Scanner;

public class Main {

	public static void main(String[] args) {

		Scanner scan = new Scanner(System.in);

		int N = scan.nextInt();
		int K = scan.nextInt();
		int[] d = new int[K];
		int[][] A = new int[K][N];
		int[] x = new int[N];
		int ans =0;
		for (int i = 0; i < N; i++) {
			x[i] = 0;
		}
		for (int i = 0; i < K; i++) {
			d[i] = scan.nextInt();
			for (int j = 0; j < d[i]; j++) {
				A[i][j] = scan.nextInt();
			}
		}

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

		for (int i = 0; i < N; i++) {
			if (x[i] == 0) {
				ans++;
			}
		}

		System.out.println(ans);
	}

} import java.util.Scanner; Scanner java.util public class Main {

	public static void main(String[] args) {

		Scanner scan = new Scanner(System.in);

		int N = scan.nextInt();
		int K = scan.nextInt();
		int[] d = new int[K];
		int[][] A = new int[K][N];
		int[] x = new int[N];
		int ans =0;
		for (int i = 0; i < N; i++) {
			x[i] = 0;
		}
		for (int i = 0; i < K; i++) {
			d[i] = scan.nextInt();
			for (int j = 0; j < d[i]; j++) {
				A[i][j] = scan.nextInt();
			}
		}

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

		for (int i = 0; i < N; i++) {
			if (x[i] == 0) {
				ans++;
			}
		}

		System.out.println(ans);
	}

} Main public static void main(String[] args) {

		Scanner scan = new Scanner(System.in);

		int N = scan.nextInt();
		int K = scan.nextInt();
		int[] d = new int[K];
		int[][] A = new int[K][N];
		int[] x = new int[N];
		int ans =0;
		for (int i = 0; i < N; i++) {
			x[i] = 0;
		}
		for (int i = 0; i < K; i++) {
			d[i] = scan.nextInt();
			for (int j = 0; j < d[i]; j++) {
				A[i][j] = scan.nextInt();
			}
		}

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

		for (int i = 0; i < N; i++) {
			if (x[i] == 0) {
				ans++;
			}
		}

		System.out.println(ans);
	} main {

		Scanner scan = new Scanner(System.in);

		int N = scan.nextInt();
		int K = scan.nextInt();
		int[] d = new int[K];
		int[][] A = new int[K][N];
		int[] x = new int[N];
		int ans =0;
		for (int i = 0; i < N; i++) {
			x[i] = 0;
		}
		for (int i = 0; i < K; i++) {
			d[i] = scan.nextInt();
			for (int j = 0; j < d[i]; j++) {
				A[i][j] = scan.nextInt();
			}
		}

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

		for (int i = 0; i < N; i++) {
			if (x[i] == 0) {
				ans++;
			}
		}

		System.out.println(ans);
	} Scanner scan = new Scanner(System.in); scan new Scanner(System.in) int N = scan.nextInt(); N scan.nextInt() scan.nextInt scan int K = scan.nextInt(); K scan.nextInt() scan.nextInt scan int[] d = new int[K]; d new int[K] K int[][] A = new int[K][N]; A new int[K][N] K N int[] x = new int[N]; x new int[N] N int ans =0; ans 0 for (int i = 0; i < N; i++) {
			x[i] = 0;
		} int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
			x[i] = 0;
		} {
			x[i] = 0;
		} x[i] = 0 x[i] x i 0 for (int i = 0; i < K; i++) {
			d[i] = scan.nextInt();
			for (int j = 0; j < d[i]; j++) {
				A[i][j] = scan.nextInt();
			}
		} int i = 0; int i = 0; i 0 i < K i K i++ i++ i {
			d[i] = scan.nextInt();
			for (int j = 0; j < d[i]; j++) {
				A[i][j] = scan.nextInt();
			}
		} {
			d[i] = scan.nextInt();
			for (int j = 0; j < d[i]; j++) {
				A[i][j] = scan.nextInt();
			}
		} d[i] = scan.nextInt() d[i] d i scan.nextInt() scan.nextInt scan for (int j = 0; j < d[i]; j++) {
				A[i][j] = scan.nextInt();
			} int j = 0; int j = 0; j 0 j < d[i] j d[i] d i j++ j++ j {
				A[i][j] = scan.nextInt();
			} {
				A[i][j] = scan.nextInt();
			} A[i][j] = scan.nextInt() A[i][j] A[i] A i j scan.nextInt() scan.nextInt scan for (int i = 0; i < K; i++) {
			for (int j = 0; j < d[i]; j++) {
				x[A[i][j]-1] = 1;
			}
		} int i = 0; int i = 0; i 0 i < K i K i++ i++ i {
			for (int j = 0; j < d[i]; j++) {
				x[A[i][j]-1] = 1;
			}
		} {
			for (int j = 0; j < d[i]; j++) {
				x[A[i][j]-1] = 1;
			}
		} for (int j = 0; j < d[i]; j++) {
				x[A[i][j]-1] = 1;
			} int j = 0; int j = 0; j 0 j < d[i] j d[i] d i j++ j++ j {
				x[A[i][j]-1] = 1;
			} {
				x[A[i][j]-1] = 1;
			} x[A[i][j]-1] = 1 x[A[i][j]-1] x A[i][j]-1 A[i][j] A[i] A i j 1 1 for (int i = 0; i < N; i++) {
			if (x[i] == 0) {
				ans++;
			}
		} int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
			if (x[i] == 0) {
				ans++;
			}
		} {
			if (x[i] == 0) {
				ans++;
			}
		} if (x[i] == 0) {
				ans++;
			} x[i] == 0 x[i] x i 0 {
				ans++;
			} ans++ ans System.out.println(ans) System.out.println System.out System System.out ans String[] args args public class Main {

	public static void main(String[] args) {

		Scanner scan = new Scanner(System.in);

		int N = scan.nextInt();
		int K = scan.nextInt();
		int[] d = new int[K];
		int[][] A = new int[K][N];
		int[] x = new int[N];
		int ans =0;
		for (int i = 0; i < N; i++) {
			x[i] = 0;
		}
		for (int i = 0; i < K; i++) {
			d[i] = scan.nextInt();
			for (int j = 0; j < d[i]; j++) {
				A[i][j] = scan.nextInt();
			}
		}

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

		for (int i = 0; i < N; i++) {
			if (x[i] == 0) {
				ans++;
			}
		}

		System.out.println(ans);
	}

} public class Main {

	public static void main(String[] args) {

		Scanner scan = new Scanner(System.in);

		int N = scan.nextInt();
		int K = scan.nextInt();
		int[] d = new int[K];
		int[][] A = new int[K][N];
		int[] x = new int[N];
		int ans =0;
		for (int i = 0; i < N; i++) {
			x[i] = 0;
		}
		for (int i = 0; i < K; i++) {
			d[i] = scan.nextInt();
			for (int j = 0; j < d[i]; j++) {
				A[i][j] = scan.nextInt();
			}
		}

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

		for (int i = 0; i < N; i++) {
			if (x[i] == 0) {
				ans++;
			}
		}

		System.out.println(ans);
	}

} Main
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {

		Scanner scan = new Scanner(System.in);

		int N = scan.nextInt();
		int K = scan.nextInt();
		int[] d = new int[K];
		int[][] A = new int[K][N];
		int[] x = new int[N];
		int ans =0;
		for (int i = 0; i < N; i++) {
			x[i] = 0;
		}
		for (int i = 0; i < K; i++) {
			d[i] = scan.nextInt();
			for (int j = 0; j < d[i]; j++) {
				A[i][j] = scan.nextInt();
			}
		}

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

		for (int i = 0; i < N; i++) {
			if (x[i] == 0) {
				ans++;
			}
		}

		System.out.println(ans);
	}

}