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);
        abc166_b solver = new abc166_b();
        solver.solve(1, in, out);
        out.close();
    }

    static class abc166_b {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int K = in.nextInt();
            int sunuke[] = new int[N];
            for (int i = 0; i < K; i++) {
                int d = in.nextInt();
                for (int j = 0; j < d; j++) {
                    int sunuidx = in.nextInt() - 1;
                    sunuke[sunuidx]++;
                }
            }
            int count = 0;
            for (int i = 0; i < N; i++) {
                if (sunuke[i] == 0) {
                    count++;
                }
            }
            out.println(count);

        }

    }
}
 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);
        abc166_b solver = new abc166_b();
        solver.solve(1, in, out);
        out.close();
    }

    static class abc166_b {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int K = in.nextInt();
            int sunuke[] = new int[N];
            for (int i = 0; i < K; i++) {
                int d = in.nextInt();
                for (int j = 0; j < d; j++) {
                    int sunuidx = in.nextInt() - 1;
                    sunuke[sunuidx]++;
                }
            }
            int count = 0;
            for (int i = 0; i < N; i++) {
                if (sunuke[i] == 0) {
                    count++;
                }
            }
            out.println(count);

        }

    }
} 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);
        abc166_b solver = new abc166_b();
        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);
        abc166_b solver = new abc166_b();
        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) abc166_b solver = new abc166_b(); solver new abc166_b() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class abc166_b {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int K = in.nextInt();
            int sunuke[] = new int[N];
            for (int i = 0; i < K; i++) {
                int d = in.nextInt();
                for (int j = 0; j < d; j++) {
                    int sunuidx = in.nextInt() - 1;
                    sunuke[sunuidx]++;
                }
            }
            int count = 0;
            for (int i = 0; i < N; i++) {
                if (sunuke[i] == 0) {
                    count++;
                }
            }
            out.println(count);

        }

    } abc166_b public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int K = in.nextInt();
            int sunuke[] = new int[N];
            for (int i = 0; i < K; i++) {
                int d = in.nextInt();
                for (int j = 0; j < d; j++) {
                    int sunuidx = in.nextInt() - 1;
                    sunuke[sunuidx]++;
                }
            }
            int count = 0;
            for (int i = 0; i < N; i++) {
                if (sunuke[i] == 0) {
                    count++;
                }
            }
            out.println(count);

        } solve {
            int N = in.nextInt();
            int K = in.nextInt();
            int sunuke[] = new int[N];
            for (int i = 0; i < K; i++) {
                int d = in.nextInt();
                for (int j = 0; j < d; j++) {
                    int sunuidx = in.nextInt() - 1;
                    sunuke[sunuidx]++;
                }
            }
            int count = 0;
            for (int i = 0; i < N; i++) {
                if (sunuke[i] == 0) {
                    count++;
                }
            }
            out.println(count);

        } int N = in.nextInt(); N in.nextInt() in.nextInt in int K = in.nextInt(); K in.nextInt() in.nextInt in int sunuke[] = new int[N]; sunuke new int[N] N for (int i = 0; i < K; i++) {
                int d = in.nextInt();
                for (int j = 0; j < d; j++) {
                    int sunuidx = in.nextInt() - 1;
                    sunuke[sunuidx]++;
                }
            } 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 sunuidx = in.nextInt() - 1;
                    sunuke[sunuidx]++;
                }
            } {
                int d = in.nextInt();
                for (int j = 0; j < d; j++) {
                    int sunuidx = in.nextInt() - 1;
                    sunuke[sunuidx]++;
                }
            } int d = in.nextInt(); d in.nextInt() in.nextInt in for (int j = 0; j < d; j++) {
                    int sunuidx = in.nextInt() - 1;
                    sunuke[sunuidx]++;
                } int j = 0; int j = 0; j 0 j < d j d j++ j++ j {
                    int sunuidx = in.nextInt() - 1;
                    sunuke[sunuidx]++;
                } {
                    int sunuidx = in.nextInt() - 1;
                    sunuke[sunuidx]++;
                } int sunuidx = in.nextInt() - 1; sunuidx in.nextInt() - 1 in.nextInt() in.nextInt in 1 sunuke[sunuidx]++ sunuke[sunuidx] sunuke sunuidx int count = 0; count 0 for (int i = 0; i < N; i++) {
                if (sunuke[i] == 0) {
                    count++;
                }
            } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
                if (sunuke[i] == 0) {
                    count++;
                }
            } {
                if (sunuke[i] == 0) {
                    count++;
                }
            } if (sunuke[i] == 0) {
                    count++;
                } sunuke[i] == 0 sunuke[i] sunuke i 0 {
                    count++;
                } count++ count out.println(count) out.println out count 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);
        abc166_b solver = new abc166_b();
        solver.solve(1, in, out);
        out.close();
    }

    static class abc166_b {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int K = in.nextInt();
            int sunuke[] = new int[N];
            for (int i = 0; i < K; i++) {
                int d = in.nextInt();
                for (int j = 0; j < d; j++) {
                    int sunuidx = in.nextInt() - 1;
                    sunuke[sunuidx]++;
                }
            }
            int count = 0;
            for (int i = 0; i < N; i++) {
                if (sunuke[i] == 0) {
                    count++;
                }
            }
            out.println(count);

        }

    }
} 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);
        abc166_b solver = new abc166_b();
        solver.solve(1, in, out);
        out.close();
    }

    static class abc166_b {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int K = in.nextInt();
            int sunuke[] = new int[N];
            for (int i = 0; i < K; i++) {
                int d = in.nextInt();
                for (int j = 0; j < d; j++) {
                    int sunuidx = in.nextInt() - 1;
                    sunuke[sunuidx]++;
                }
            }
            int count = 0;
            for (int i = 0; i < N; i++) {
                if (sunuke[i] == 0) {
                    count++;
                }
            }
            out.println(count);

        }

    }
} 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);
        abc166_b solver = new abc166_b();
        solver.solve(1, in, out);
        out.close();
    }

    static class abc166_b {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int K = in.nextInt();
            int sunuke[] = new int[N];
            for (int i = 0; i < K; i++) {
                int d = in.nextInt();
                for (int j = 0; j < d; j++) {
                    int sunuidx = in.nextInt() - 1;
                    sunuke[sunuidx]++;
                }
            }
            int count = 0;
            for (int i = 0; i < N; i++) {
                if (sunuke[i] == 0) {
                    count++;
                }
            }
            out.println(count);

        }

    }
}

