import java.util.*;
import java.math.BigInteger;
public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int k = sc.nextInt();
    boolean[] sunukes = new boolean[n];
    for (int i = 0; i < k; i++) {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) {
        sunukes[sc.nextInt() - 1] = true;
      }
    }
    int ans = 0;
    for (boolean hasSweets : sunukes) {
      if (hasSweets) continue;
      ans++;
    }
    System.out.println(ans);
  }
} import java.util.*; util.* java import java.math.BigInteger; BigInteger java.math public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int k = sc.nextInt();
    boolean[] sunukes = new boolean[n];
    for (int i = 0; i < k; i++) {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) {
        sunukes[sc.nextInt() - 1] = true;
      }
    }
    int ans = 0;
    for (boolean hasSweets : sunukes) {
      if (hasSweets) continue;
      ans++;
    }
    System.out.println(ans);
  }
} Main public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int k = sc.nextInt();
    boolean[] sunukes = new boolean[n];
    for (int i = 0; i < k; i++) {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) {
        sunukes[sc.nextInt() - 1] = true;
      }
    }
    int ans = 0;
    for (boolean hasSweets : sunukes) {
      if (hasSweets) continue;
      ans++;
    }
    System.out.println(ans);
  } main {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int k = sc.nextInt();
    boolean[] sunukes = new boolean[n];
    for (int i = 0; i < k; i++) {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) {
        sunukes[sc.nextInt() - 1] = true;
      }
    }
    int ans = 0;
    for (boolean hasSweets : sunukes) {
      if (hasSweets) continue;
      ans++;
    }
    System.out.println(ans);
  } 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[] sunukes = new boolean[n]; sunukes new boolean[n] n for (int i = 0; i < k; i++) {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) {
        sunukes[sc.nextInt() - 1] = 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++) {
        sunukes[sc.nextInt() - 1] = true;
      }
    } {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) {
        sunukes[sc.nextInt() - 1] = true;
      }
    } int d = sc.nextInt(); d sc.nextInt() sc.nextInt sc for (int j = 0; j < d; j++) {
        sunukes[sc.nextInt() - 1] = true;
      } int j = 0; int j = 0; j 0 j < d j d j++ j++ j {
        sunukes[sc.nextInt() - 1] = true;
      } {
        sunukes[sc.nextInt() - 1] = true;
      } sunukes[sc.nextInt() - 1] = true sunukes[sc.nextInt() - 1] sunukes sc.nextInt() - 1 sc.nextInt() sc.nextInt sc 1 true int ans = 0; ans 0 for (boolean hasSweets : sunukes) {
      if (hasSweets) continue;
      ans++;
    } boolean hasSweets sunukes {
      if (hasSweets) continue;
      ans++;
    } {
      if (hasSweets) continue;
      ans++;
    } if (hasSweets) continue; hasSweets continue; 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 sc = new Scanner(System.in);
    int n = sc.nextInt();
    int k = sc.nextInt();
    boolean[] sunukes = new boolean[n];
    for (int i = 0; i < k; i++) {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) {
        sunukes[sc.nextInt() - 1] = true;
      }
    }
    int ans = 0;
    for (boolean hasSweets : sunukes) {
      if (hasSweets) continue;
      ans++;
    }
    System.out.println(ans);
  }
} public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int k = sc.nextInt();
    boolean[] sunukes = new boolean[n];
    for (int i = 0; i < k; i++) {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) {
        sunukes[sc.nextInt() - 1] = true;
      }
    }
    int ans = 0;
    for (boolean hasSweets : sunukes) {
      if (hasSweets) continue;
      ans++;
    }
    System.out.println(ans);
  }
} Main
import java.util.*;
import java.math.BigInteger;
public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int k = sc.nextInt();
    boolean[] sunukes = new boolean[n];
    for (int i = 0; i < k; i++) {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) {
        sunukes[sc.nextInt() - 1] = true;
      }
    }
    int ans = 0;
    for (boolean hasSweets : sunukes) {
      if (hasSweets) continue;
      ans++;
    }
    System.out.println(ans);
  }
}
