import java.util.*;

class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int K = sc.nextInt();
    boolean[] hasSweets = new boolean[N+1];
    for (int i = 0; i < K; i++) {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) hasSweets[sc.nextInt()] = true;
    }
    int ans = 0;
    for (boolean h : hasSweets) if (!h) ans++;
    System.out.println(ans-1);
  }
} import java.util.*; util.* java class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int K = sc.nextInt();
    boolean[] hasSweets = new boolean[N+1];
    for (int i = 0; i < K; i++) {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) hasSweets[sc.nextInt()] = true;
    }
    int ans = 0;
    for (boolean h : hasSweets) if (!h) ans++;
    System.out.println(ans-1);
  }
} Main public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int K = sc.nextInt();
    boolean[] hasSweets = new boolean[N+1];
    for (int i = 0; i < K; i++) {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) hasSweets[sc.nextInt()] = true;
    }
    int ans = 0;
    for (boolean h : hasSweets) if (!h) ans++;
    System.out.println(ans-1);
  } main {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int K = sc.nextInt();
    boolean[] hasSweets = new boolean[N+1];
    for (int i = 0; i < K; i++) {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) hasSweets[sc.nextInt()] = true;
    }
    int ans = 0;
    for (boolean h : hasSweets) if (!h) ans++;
    System.out.println(ans-1);
  } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int K = sc.nextInt(); K sc.nextInt() sc.nextInt sc boolean[] hasSweets = new boolean[N+1]; hasSweets new boolean[N+1] N+1 N 1 for (int i = 0; i < K; i++) {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) hasSweets[sc.nextInt()] = true;
    } int i = 0; int i = 0; i 0 i < K i K i++ i++ i {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) hasSweets[sc.nextInt()] = true;
    } {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) hasSweets[sc.nextInt()] = true;
    } int d = sc.nextInt(); d sc.nextInt() sc.nextInt sc for (int j = 0; j < d; j++) hasSweets[sc.nextInt()] = true; int j = 0; int j = 0; j 0 j < d j d j++ j++ j hasSweets[sc.nextInt()] = true; hasSweets[sc.nextInt()] = true hasSweets[sc.nextInt()] hasSweets sc.nextInt() sc.nextInt sc true int ans = 0; ans 0 for (boolean h : hasSweets) if (!h) ans++; boolean h hasSweets if (!h) ans++; if (!h) ans++; !h h ans++ ans System.out.println(ans-1) System.out.println System.out System System.out ans-1 ans 1 String[] args args
import java.util.*;

class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int K = sc.nextInt();
    boolean[] hasSweets = new boolean[N+1];
    for (int i = 0; i < K; i++) {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) hasSweets[sc.nextInt()] = true;
    }
    int ans = 0;
    for (boolean h : hasSweets) if (!h) ans++;
    System.out.println(ans-1);
  }
}