import java.util.Arrays;

	public class Main {
		 
		public static void main(String[] args) {
	 
			java.util.Scanner scan = new java.util.Scanner(System.in);
		

			int n = scan.nextInt();
			int k = scan.nextInt();
			Integer[] a = new Integer [n];
			int iii = 0;
			int sum = 0;
			
			for (int i = 0 ; i < k ; i++) {
				int m = scan.nextInt();
				for(int ii = 0; ii < m ; ii++) {
					int b = scan.nextInt();
					if(Arrays.asList(a).contains(b)) {
						
					} else {
						a[iii] = b;
						iii++;
					}
				}
			}
		for (int i = 1; i <= n ; i++ ) {
			for (int ii = 0 ; ii < iii; ii++) {
				if(a[ii] == i) {
					break;
				} else if (ii == iii-1) {
					sum ++;
				}
			}
		}
		
		
		System.out.println(sum);
		
		
		}
	 
	}

/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