import java.util.Scanner;
class Main{
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int K = sc.nextInt();
    boolean[] hasSunuke = new boolean[N];
    for(int i = 1;i <= K;i++) {
      int di = sc.nextInt();
      for(int j = 0;j < di;j++) {
        int a = sc.nextInt();
        hasSunuke[a-1] = true;
      }
    }
    int result = 0;
    for(int i = 0;i < hasSunuke.length;i++) {
      if(!hasSunuke[i]) {
        result++;
      }
    }
    System.out.println(result);
  }
}
/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