import java.io.PrintWriter;
import java.util.*;

public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        PrintWriter printWriter = new PrintWriter(System.out);
        Set<Integer> treeSet = new TreeSet<Integer>();
        int n = scanner.nextInt();
        int k = scanner.nextInt();
        for (int i = 0; i < k; i++){
            int d = scanner.nextInt();
            for (int j = 0; j < d; j++){
                treeSet.add(scanner.nextInt());
            }
        }
        int count = 0;
        for (int i = 1; i < n + 1; i++) {
            if (!treeSet.contains(i)) {
                count++;
            }
        }
        printWriter.println(count);
        printWriter.flush();
    }
} import java.io.PrintWriter; PrintWriter java.io import java.util.*; util.* java public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        PrintWriter printWriter = new PrintWriter(System.out);
        Set<Integer> treeSet = new TreeSet<Integer>();
        int n = scanner.nextInt();
        int k = scanner.nextInt();
        for (int i = 0; i < k; i++){
            int d = scanner.nextInt();
            for (int j = 0; j < d; j++){
                treeSet.add(scanner.nextInt());
            }
        }
        int count = 0;
        for (int i = 1; i < n + 1; i++) {
            if (!treeSet.contains(i)) {
                count++;
            }
        }
        printWriter.println(count);
        printWriter.flush();
    }
} Main public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        PrintWriter printWriter = new PrintWriter(System.out);
        Set<Integer> treeSet = new TreeSet<Integer>();
        int n = scanner.nextInt();
        int k = scanner.nextInt();
        for (int i = 0; i < k; i++){
            int d = scanner.nextInt();
            for (int j = 0; j < d; j++){
                treeSet.add(scanner.nextInt());
            }
        }
        int count = 0;
        for (int i = 1; i < n + 1; i++) {
            if (!treeSet.contains(i)) {
                count++;
            }
        }
        printWriter.println(count);
        printWriter.flush();
    } main {
        Scanner scanner = new Scanner(System.in);
        PrintWriter printWriter = new PrintWriter(System.out);
        Set<Integer> treeSet = new TreeSet<Integer>();
        int n = scanner.nextInt();
        int k = scanner.nextInt();
        for (int i = 0; i < k; i++){
            int d = scanner.nextInt();
            for (int j = 0; j < d; j++){
                treeSet.add(scanner.nextInt());
            }
        }
        int count = 0;
        for (int i = 1; i < n + 1; i++) {
            if (!treeSet.contains(i)) {
                count++;
            }
        }
        printWriter.println(count);
        printWriter.flush();
    } Scanner scanner = new Scanner(System.in); scanner new Scanner(System.in) PrintWriter printWriter = new PrintWriter(System.out); printWriter new PrintWriter(System.out) Set<Integer> treeSet = new TreeSet<Integer>(); treeSet new TreeSet<Integer>() int n = scanner.nextInt(); n scanner.nextInt() scanner.nextInt scanner int k = scanner.nextInt(); k scanner.nextInt() scanner.nextInt scanner for (int i = 0; i < k; i++){
            int d = scanner.nextInt();
            for (int j = 0; j < d; j++){
                treeSet.add(scanner.nextInt());
            }
        } int i = 0; int i = 0; i 0 i < k i k i++ i++ i {
            int d = scanner.nextInt();
            for (int j = 0; j < d; j++){
                treeSet.add(scanner.nextInt());
            }
        } {
            int d = scanner.nextInt();
            for (int j = 0; j < d; j++){
                treeSet.add(scanner.nextInt());
            }
        } int d = scanner.nextInt(); d scanner.nextInt() scanner.nextInt scanner for (int j = 0; j < d; j++){
                treeSet.add(scanner.nextInt());
            } int j = 0; int j = 0; j 0 j < d j d j++ j++ j {
                treeSet.add(scanner.nextInt());
            } {
                treeSet.add(scanner.nextInt());
            } treeSet.add(scanner.nextInt()) treeSet.add treeSet scanner.nextInt() scanner.nextInt scanner int count = 0; count 0 for (int i = 1; i < n + 1; i++) {
            if (!treeSet.contains(i)) {
                count++;
            }
        } int i = 1; int i = 1; i 1 i < n + 1 i n + 1 n 1 i++ i++ i {
            if (!treeSet.contains(i)) {
                count++;
            }
        } {
            if (!treeSet.contains(i)) {
                count++;
            }
        } if (!treeSet.contains(i)) {
                count++;
            } !treeSet.contains(i) treeSet.contains(i) treeSet.contains treeSet i {
                count++;
            } count++ count printWriter.println(count) printWriter.println printWriter count printWriter.flush() printWriter.flush printWriter String[] args args public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        PrintWriter printWriter = new PrintWriter(System.out);
        Set<Integer> treeSet = new TreeSet<Integer>();
        int n = scanner.nextInt();
        int k = scanner.nextInt();
        for (int i = 0; i < k; i++){
            int d = scanner.nextInt();
            for (int j = 0; j < d; j++){
                treeSet.add(scanner.nextInt());
            }
        }
        int count = 0;
        for (int i = 1; i < n + 1; i++) {
            if (!treeSet.contains(i)) {
                count++;
            }
        }
        printWriter.println(count);
        printWriter.flush();
    }
} public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        PrintWriter printWriter = new PrintWriter(System.out);
        Set<Integer> treeSet = new TreeSet<Integer>();
        int n = scanner.nextInt();
        int k = scanner.nextInt();
        for (int i = 0; i < k; i++){
            int d = scanner.nextInt();
            for (int j = 0; j < d; j++){
                treeSet.add(scanner.nextInt());
            }
        }
        int count = 0;
        for (int i = 1; i < n + 1; i++) {
            if (!treeSet.contains(i)) {
                count++;
            }
        }
        printWriter.println(count);
        printWriter.flush();
    }
} Main
import java.io.PrintWriter;
import java.util.*;

public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        PrintWriter printWriter = new PrintWriter(System.out);
        Set<Integer> treeSet = new TreeSet<Integer>();
        int n = scanner.nextInt();
        int k = scanner.nextInt();
        for (int i = 0; i < k; i++){
            int d = scanner.nextInt();
            for (int j = 0; j < d; j++){
                treeSet.add(scanner.nextInt());
            }
        }
        int count = 0;
        for (int i = 1; i < n + 1; i++) {
            if (!treeSet.contains(i)) {
                count++;
            }
        }
        printWriter.println(count);
        printWriter.flush();
    }
}
