import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TrickOrTreat solver = new TrickOrTreat();
        solver.solve(1, in, out);
        out.close();
    }

    static class TrickOrTreat {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int k = in.nextInt();

            boolean[] statuses = new boolean[n + 1];

            for (int i = 0; i < k; i++) {
                int d = in.nextInt();
                for (int j = 0; j < d; j++) {
                    int a = in.nextInt();
                    statuses[a] = true;
                }
            }

            int result = 0;
            for (int i = 1; i < statuses.length; i++) {
                if (statuses[i]) {
                    result++;
                }
            }
            out.append(String.valueOf(n - result));
        }

    }
}
 import java.io.OutputStream; OutputStream java.io import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.util.Scanner; Scanner java.util public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TrickOrTreat solver = new TrickOrTreat();
        solver.solve(1, in, out);
        out.close();
    }

    static class TrickOrTreat {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int k = in.nextInt();

            boolean[] statuses = new boolean[n + 1];

            for (int i = 0; i < k; i++) {
                int d = in.nextInt();
                for (int j = 0; j < d; j++) {
                    int a = in.nextInt();
                    statuses[a] = true;
                }
            }

            int result = 0;
            for (int i = 1; i < statuses.length; i++) {
                if (statuses[i]) {
                    result++;
                }
            }
            out.append(String.valueOf(n - result));
        }

    }
} Main public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TrickOrTreat solver = new TrickOrTreat();
        solver.solve(1, in, out);
        out.close();
    } main {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TrickOrTreat solver = new TrickOrTreat();
        solver.solve(1, in, out);
        out.close();
    } InputStream inputStream = System.in; inputStream System.in System System.in OutputStream outputStream = System.out; outputStream System.out System System.out Scanner in = new Scanner(inputStream); in new Scanner(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) TrickOrTreat solver = new TrickOrTreat(); solver new TrickOrTreat() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class TrickOrTreat {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int k = in.nextInt();

            boolean[] statuses = new boolean[n + 1];

            for (int i = 0; i < k; i++) {
                int d = in.nextInt();
                for (int j = 0; j < d; j++) {
                    int a = in.nextInt();
                    statuses[a] = true;
                }
            }

            int result = 0;
            for (int i = 1; i < statuses.length; i++) {
                if (statuses[i]) {
                    result++;
                }
            }
            out.append(String.valueOf(n - result));
        }

    } TrickOrTreat public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int k = in.nextInt();

            boolean[] statuses = new boolean[n + 1];

            for (int i = 0; i < k; i++) {
                int d = in.nextInt();
                for (int j = 0; j < d; j++) {
                    int a = in.nextInt();
                    statuses[a] = true;
                }
            }

            int result = 0;
            for (int i = 1; i < statuses.length; i++) {
                if (statuses[i]) {
                    result++;
                }
            }
            out.append(String.valueOf(n - result));
        } solve {
            int n = in.nextInt();
            int k = in.nextInt();

            boolean[] statuses = new boolean[n + 1];

            for (int i = 0; i < k; i++) {
                int d = in.nextInt();
                for (int j = 0; j < d; j++) {
                    int a = in.nextInt();
                    statuses[a] = true;
                }
            }

            int result = 0;
            for (int i = 1; i < statuses.length; i++) {
                if (statuses[i]) {
                    result++;
                }
            }
            out.append(String.valueOf(n - result));
        } int n = in.nextInt(); n in.nextInt() in.nextInt in int k = in.nextInt(); k in.nextInt() in.nextInt in boolean[] statuses = new boolean[n + 1]; statuses new boolean[n + 1] n + 1 n 1 for (int i = 0; i < k; i++) {
                int d = in.nextInt();
                for (int j = 0; j < d; j++) {
                    int a = in.nextInt();
                    statuses[a] = true;
                }
            } int i = 0; int i = 0; i 0 i < k i k i++ i++ i {
                int d = in.nextInt();
                for (int j = 0; j < d; j++) {
                    int a = in.nextInt();
                    statuses[a] = true;
                }
            } {
                int d = in.nextInt();
                for (int j = 0; j < d; j++) {
                    int a = in.nextInt();
                    statuses[a] = true;
                }
            } int d = in.nextInt(); d in.nextInt() in.nextInt in for (int j = 0; j < d; j++) {
                    int a = in.nextInt();
                    statuses[a] = true;
                } int j = 0; int j = 0; j 0 j < d j d j++ j++ j {
                    int a = in.nextInt();
                    statuses[a] = true;
                } {
                    int a = in.nextInt();
                    statuses[a] = true;
                } int a = in.nextInt(); a in.nextInt() in.nextInt in statuses[a] = true statuses[a] statuses a true int result = 0; result 0 for (int i = 1; i < statuses.length; i++) {
                if (statuses[i]) {
                    result++;
                }
            } int i = 1; int i = 1; i 1 i < statuses.length i statuses.length statuses statuses.length i++ i++ i {
                if (statuses[i]) {
                    result++;
                }
            } {
                if (statuses[i]) {
                    result++;
                }
            } if (statuses[i]) {
                    result++;
                } statuses[i] statuses i {
                    result++;
                } result++ result out.append(String.valueOf(n - result)) out.append out String.valueOf(n - result) String.valueOf String n - result n result int testNumber testNumber Scanner in in PrintWriter out out public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TrickOrTreat solver = new TrickOrTreat();
        solver.solve(1, in, out);
        out.close();
    }

    static class TrickOrTreat {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int k = in.nextInt();

            boolean[] statuses = new boolean[n + 1];

            for (int i = 0; i < k; i++) {
                int d = in.nextInt();
                for (int j = 0; j < d; j++) {
                    int a = in.nextInt();
                    statuses[a] = true;
                }
            }

            int result = 0;
            for (int i = 1; i < statuses.length; i++) {
                if (statuses[i]) {
                    result++;
                }
            }
            out.append(String.valueOf(n - result));
        }

    }
} public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TrickOrTreat solver = new TrickOrTreat();
        solver.solve(1, in, out);
        out.close();
    }

    static class TrickOrTreat {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int k = in.nextInt();

            boolean[] statuses = new boolean[n + 1];

            for (int i = 0; i < k; i++) {
                int d = in.nextInt();
                for (int j = 0; j < d; j++) {
                    int a = in.nextInt();
                    statuses[a] = true;
                }
            }

            int result = 0;
            for (int i = 1; i < statuses.length; i++) {
                if (statuses[i]) {
                    result++;
                }
            }
            out.append(String.valueOf(n - result));
        }

    }
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TrickOrTreat solver = new TrickOrTreat();
        solver.solve(1, in, out);
        out.close();
    }

    static class TrickOrTreat {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int k = in.nextInt();

            boolean[] statuses = new boolean[n + 1];

            for (int i = 0; i < k; i++) {
                int d = in.nextInt();
                for (int j = 0; j < d; j++) {
                    int a = in.nextInt();
                    statuses[a] = true;
                }
            }

            int result = 0;
            for (int i = 1; i < statuses.length; i++) {
                if (statuses[i]) {
                    result++;
                }
            }
            out.append(String.valueOf(n - result));
        }

    }
}

