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

import static java.lang.Math.*;
import static java.util.Arrays.fill;

public class Main {

    static void run() throws IOException {
        file("", "");
        long time = System.currentTimeMillis();
//        int t = nextInt();
//        while (t-- > 0)
        solution();
        end(time);
    }

    static void solution() throws IOException {
        int n = nextInt();
        int k = nextInt();
        TreeSet<Integer> tr = new TreeSet<>();
        for (int i = 0; i < k; i++) {
            int l = nextInt();
            for (int j = 0; j < l; j++) {
                tr.add(nextInt());
            }
        }
        out.println(n-tr.size());
    }

    static mem create_mem(int to, int val) {
        mem y = new mem();
        y.to = to;
        y.val = val;
        return y;
    }

    static class mem {
        int to, val;
    }


    static void Z_function() throws IOException {
        char[] s = nextToken().toCharArray();
        int[] z = new int[s.length];
        for (int i = 1, l = 0, r = 0; i < s.length; i++) {
            if (i <= r)
                z[i] = min(r - i + 1, z[i - l]);
            while (z[i] + i < s.length && s[z[i] + i] == s[z[i]])
                ++z[i];
            if (i + z[i] - 1 > r) {
                l = i;
                r = i + z[i] - 1;
            }
        }
        for (int i = 0; i < z.length; i++) {
            out.print(z[i] + " ");
        }
    }

    static long pow(long a, long b) {
        long h = 1;
        while (b > 0) {
            if (b % 2 != 0) {
                h *= a;
                b--;
            }
            b /= 2;
            a *= a;
        }
        return h;
    }

    static long lcm(long a, long b) {
        return a * b / gcd(a, b);
    }

    static long gcd(long a, long b) {
        return b == 0 ? a : gcd(b, a % b);
    }

    static void end(long time) {
        out.flush();
        System.err.println("seconds : " + (System.currentTimeMillis() - time) / 1000 +
                "  milliseconds : " + (System.currentTimeMillis() - time) % 1000);
        out.close();
    }

    static BufferedReader br;
    static PrintWriter out;

    static void file(String input, String output) {
        if (input.equals("")) {
            br = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            try {
                br = new BufferedReader(new FileReader(input));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
            try {
                out = new PrintWriter(output);
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        }
    }

    static StringTokenizer in = new StringTokenizer("");

    public static String nextToken() throws IOException {
        while (in == null || !in.hasMoreTokens()) {
            String s = br.readLine();
            if (s == null) return null;
            in = new StringTokenizer(s);
        }
        return in.nextToken();
    }


    public static int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    public static double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }

    public static long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }


    public static void main(String[] args) throws IOException {
        run();
    }
} import java.io.*; io.* java import java.util.*; util.* java import static java.lang.Math.*; import static java.lang.Math.*; import static java.lang.Math.*; import static java.util.Arrays.fill; import static java.util.Arrays.fill; import static java.util.Arrays.fill; public class Main {

    static void run() throws IOException {
        file("", "");
        long time = System.currentTimeMillis();
//        int t = nextInt();
//        while (t-- > 0)
        solution();
        end(time);
    }

    static void solution() throws IOException {
        int n = nextInt();
        int k = nextInt();
        TreeSet<Integer> tr = new TreeSet<>();
        for (int i = 0; i < k; i++) {
            int l = nextInt();
            for (int j = 0; j < l; j++) {
                tr.add(nextInt());
            }
        }
        out.println(n-tr.size());
    }

    static mem create_mem(int to, int val) {
        mem y = new mem();
        y.to = to;
        y.val = val;
        return y;
    }

    static class mem {
        int to, val;
    }


    static void Z_function() throws IOException {
        char[] s = nextToken().toCharArray();
        int[] z = new int[s.length];
        for (int i = 1, l = 0, r = 0; i < s.length; i++) {
            if (i <= r)
                z[i] = min(r - i + 1, z[i - l]);
            while (z[i] + i < s.length && s[z[i] + i] == s[z[i]])
                ++z[i];
            if (i + z[i] - 1 > r) {
                l = i;
                r = i + z[i] - 1;
            }
        }
        for (int i = 0; i < z.length; i++) {
            out.print(z[i] + " ");
        }
    }

    static long pow(long a, long b) {
        long h = 1;
        while (b > 0) {
            if (b % 2 != 0) {
                h *= a;
                b--;
            }
            b /= 2;
            a *= a;
        }
        return h;
    }

    static long lcm(long a, long b) {
        return a * b / gcd(a, b);
    }

    static long gcd(long a, long b) {
        return b == 0 ? a : gcd(b, a % b);
    }

    static void end(long time) {
        out.flush();
        System.err.println("seconds : " + (System.currentTimeMillis() - time) / 1000 +
                "  milliseconds : " + (System.currentTimeMillis() - time) % 1000);
        out.close();
    }

    static BufferedReader br;
    static PrintWriter out;

    static void file(String input, String output) {
        if (input.equals("")) {
            br = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            try {
                br = new BufferedReader(new FileReader(input));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
            try {
                out = new PrintWriter(output);
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        }
    }

    static StringTokenizer in = new StringTokenizer("");

    public static String nextToken() throws IOException {
        while (in == null || !in.hasMoreTokens()) {
            String s = br.readLine();
            if (s == null) return null;
            in = new StringTokenizer(s);
        }
        return in.nextToken();
    }


    public static int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    public static double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }

    public static long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }


    public static void main(String[] args) throws IOException {
        run();
    }
} Main static BufferedReader br; br static PrintWriter out; out static StringTokenizer in = new StringTokenizer(""); in new StringTokenizer("") static void run() throws IOException {
        file("", "");
        long time = System.currentTimeMillis();
//        int t = nextInt();
//        while (t-- > 0)
        solution();
        end(time);
    } run {
        file("", "");
        long time = System.currentTimeMillis();
//        int t = nextInt();
//        while (t-- > 0)
        solution();
        end(time);
    } file("", "") file "" "" long time = System.currentTimeMillis(); time System.currentTimeMillis() System.currentTimeMillis System solution() solution end(time) end time static void solution() throws IOException {
        int n = nextInt();
        int k = nextInt();
        TreeSet<Integer> tr = new TreeSet<>();
        for (int i = 0; i < k; i++) {
            int l = nextInt();
            for (int j = 0; j < l; j++) {
                tr.add(nextInt());
            }
        }
        out.println(n-tr.size());
    } solution {
        int n = nextInt();
        int k = nextInt();
        TreeSet<Integer> tr = new TreeSet<>();
        for (int i = 0; i < k; i++) {
            int l = nextInt();
            for (int j = 0; j < l; j++) {
                tr.add(nextInt());
            }
        }
        out.println(n-tr.size());
    } int n = nextInt(); n nextInt() nextInt int k = nextInt(); k nextInt() nextInt TreeSet<Integer> tr = new TreeSet<>(); tr new TreeSet<>() for (int i = 0; i < k; i++) {
            int l = nextInt();
            for (int j = 0; j < l; j++) {
                tr.add(nextInt());
            }
        } int i = 0; int i = 0; i 0 i < k i k i++ i++ i {
            int l = nextInt();
            for (int j = 0; j < l; j++) {
                tr.add(nextInt());
            }
        } {
            int l = nextInt();
            for (int j = 0; j < l; j++) {
                tr.add(nextInt());
            }
        } int l = nextInt(); l nextInt() nextInt for (int j = 0; j < l; j++) {
                tr.add(nextInt());
            } int j = 0; int j = 0; j 0 j < l j l j++ j++ j {
                tr.add(nextInt());
            } {
                tr.add(nextInt());
            } tr.add(nextInt()) tr.add tr nextInt() nextInt out.println(n-tr.size()) out.println out n-tr.size() n tr.size() tr.size tr static mem create_mem(int to, int val) {
        mem y = new mem();
        y.to = to;
        y.val = val;
        return y;
    } create_mem {
        mem y = new mem();
        y.to = to;
        y.val = val;
        return y;
    } mem y = new mem(); y new mem() y.to = to y.to y y.to to y.val = val y.val y y.val val return y; y int to to int val val static void Z_function() throws IOException {
        char[] s = nextToken().toCharArray();
        int[] z = new int[s.length];
        for (int i = 1, l = 0, r = 0; i < s.length; i++) {
            if (i <= r)
                z[i] = min(r - i + 1, z[i - l]);
            while (z[i] + i < s.length && s[z[i] + i] == s[z[i]])
                ++z[i];
            if (i + z[i] - 1 > r) {
                l = i;
                r = i + z[i] - 1;
            }
        }
        for (int i = 0; i < z.length; i++) {
            out.print(z[i] + " ");
        }
    } Z_function {
        char[] s = nextToken().toCharArray();
        int[] z = new int[s.length];
        for (int i = 1, l = 0, r = 0; i < s.length; i++) {
            if (i <= r)
                z[i] = min(r - i + 1, z[i - l]);
            while (z[i] + i < s.length && s[z[i] + i] == s[z[i]])
                ++z[i];
            if (i + z[i] - 1 > r) {
                l = i;
                r = i + z[i] - 1;
            }
        }
        for (int i = 0; i < z.length; i++) {
            out.print(z[i] + " ");
        }
    } char[] s = nextToken().toCharArray(); s nextToken().toCharArray() nextToken().toCharArray nextToken() nextToken int[] z = new int[s.length]; z new int[s.length] s.length s s.length for (int i = 1, l = 0, r = 0; i < s.length; i++) {
            if (i <= r)
                z[i] = min(r - i + 1, z[i - l]);
            while (z[i] + i < s.length && s[z[i] + i] == s[z[i]])
                ++z[i];
            if (i + z[i] - 1 > r) {
                l = i;
                r = i + z[i] - 1;
            }
        } int i = 1, l = 0, r = 0; int i = 1 i 1 l = 0 l 0 r = 0; r 0 i < s.length i s.length s s.length i++ i++ i {
            if (i <= r)
                z[i] = min(r - i + 1, z[i - l]);
            while (z[i] + i < s.length && s[z[i] + i] == s[z[i]])
                ++z[i];
            if (i + z[i] - 1 > r) {
                l = i;
                r = i + z[i] - 1;
            }
        } {
            if (i <= r)
                z[i] = min(r - i + 1, z[i - l]);
            while (z[i] + i < s.length && s[z[i] + i] == s[z[i]])
                ++z[i];
            if (i + z[i] - 1 > r) {
                l = i;
                r = i + z[i] - 1;
            }
        } if (i <= r)
                z[i] = min(r - i + 1, z[i - l]); i <= r i r z[i] = min(r - i + 1, z[i - l]) z[i] z i min(r - i + 1, z[i - l]) min r - i + 1 r - i r i 1 z[i - l] z i - l i l while (z[i] + i < s.length && s[z[i] + i] == s[z[i]])
                ++z[i]; z[i] + i < s.length && s[z[i] + i] == s[z[i]] z[i] + i < s.length z[i] + i z[i] z i i s.length s s.length s[z[i] + i] == s[z[i]] s[z[i] + i] s z[i] + i z[i] z i i s[z[i]] s z[i] z i ++z[i] z[i] z i if (i + z[i] - 1 > r) {
                l = i;
                r = i + z[i] - 1;
            } i + z[i] - 1 > r i + z[i] - 1 i + z[i] i z[i] z i 1 r {
                l = i;
                r = i + z[i] - 1;
            } l = i l i r = i + z[i] - 1 r i + z[i] - 1 i + z[i] i z[i] z i 1 for (int i = 0; i < z.length; i++) {
            out.print(z[i] + " ");
        } int i = 0; int i = 0; i 0 i < z.length i z.length z z.length i++ i++ i {
            out.print(z[i] + " ");
        } {
            out.print(z[i] + " ");
        } out.print(z[i] + " ") out.print out z[i] + " " z[i] z i " " static long pow(long a, long b) {
        long h = 1;
        while (b > 0) {
            if (b % 2 != 0) {
                h *= a;
                b--;
            }
            b /= 2;
            a *= a;
        }
        return h;
    } pow {
        long h = 1;
        while (b > 0) {
            if (b % 2 != 0) {
                h *= a;
                b--;
            }
            b /= 2;
            a *= a;
        }
        return h;
    } long h = 1; h 1 while (b > 0) {
            if (b % 2 != 0) {
                h *= a;
                b--;
            }
            b /= 2;
            a *= a;
        } b > 0 b 0 {
            if (b % 2 != 0) {
                h *= a;
                b--;
            }
            b /= 2;
            a *= a;
        } if (b % 2 != 0) {
                h *= a;
                b--;
            } b % 2 != 0 b % 2 b 2 0 {
                h *= a;
                b--;
            } h *= a h a b-- b b /= 2 b 2 a *= a a a return h; h long a a long b b static long lcm(long a, long b) {
        return a * b / gcd(a, b);
    } lcm {
        return a * b / gcd(a, b);
    } return a * b / gcd(a, b); a * b / gcd(a, b) a * b a b gcd(a, b) gcd a b long a a long b b static long gcd(long a, long b) {
        return b == 0 ? a : gcd(b, a % b);
    } gcd {
        return b == 0 ? a : gcd(b, a % b);
    } return b == 0 ? a : gcd(b, a % b); b == 0 ? a : gcd(b, a % b) b == 0 b 0 a gcd(b, a % b) gcd b a % b a b long a a long b b static void end(long time) {
        out.flush();
        System.err.println("seconds : " + (System.currentTimeMillis() - time) / 1000 +
                "  milliseconds : " + (System.currentTimeMillis() - time) % 1000);
        out.close();
    } end {
        out.flush();
        System.err.println("seconds : " + (System.currentTimeMillis() - time) / 1000 +
                "  milliseconds : " + (System.currentTimeMillis() - time) % 1000);
        out.close();
    } out.flush() out.flush out System.err.println("seconds : " + (System.currentTimeMillis() - time) / 1000 +
                "  milliseconds : " + (System.currentTimeMillis() - time) % 1000) System.err.println System.err System System.err "seconds : " + (System.currentTimeMillis() - time) / 1000 +
                "  milliseconds : " + (System.currentTimeMillis() - time) % 1000 "  milliseconds : " "seconds : " + (System.currentTimeMillis() - time) / 1000 +
                "  milliseconds : " + (System.currentTimeMillis() - time) % 1000 "seconds : " (System.currentTimeMillis() - time) / 1000 (System.currentTimeMillis() - time) System.currentTimeMillis() System.currentTimeMillis System time 1000 "  milliseconds : " (System.currentTimeMillis() - time) % 1000 (System.currentTimeMillis() - time) System.currentTimeMillis() System.currentTimeMillis System time 1000 out.close() out.close out long time time static void file(String input, String output) {
        if (input.equals("")) {
            br = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            try {
                br = new BufferedReader(new FileReader(input));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
            try {
                out = new PrintWriter(output);
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        }
    } file {
        if (input.equals("")) {
            br = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            try {
                br = new BufferedReader(new FileReader(input));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
            try {
                out = new PrintWriter(output);
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        }
    } if (input.equals("")) {
            br = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            try {
                br = new BufferedReader(new FileReader(input));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
            try {
                out = new PrintWriter(output);
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        } input.equals("") input.equals input "" {
            br = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } br = new BufferedReader(new InputStreamReader(System.in)) br new BufferedReader(new InputStreamReader(System.in)) out = new PrintWriter(System.out) out new PrintWriter(System.out) {
            try {
                br = new BufferedReader(new FileReader(input));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
            try {
                out = new PrintWriter(output);
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        } try {
                br = new BufferedReader(new FileReader(input));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            } FileNotFoundException e {
                e.printStackTrace();
            } e.printStackTrace() e.printStackTrace e {
                br = new BufferedReader(new FileReader(input));
            } br = new BufferedReader(new FileReader(input)) br new BufferedReader(new FileReader(input)) try {
                out = new PrintWriter(output);
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            } FileNotFoundException e {
                e.printStackTrace();
            } e.printStackTrace() e.printStackTrace e {
                out = new PrintWriter(output);
            } out = new PrintWriter(output) out new PrintWriter(output) String input input String output output public static String nextToken() throws IOException {
        while (in == null || !in.hasMoreTokens()) {
            String s = br.readLine();
            if (s == null) return null;
            in = new StringTokenizer(s);
        }
        return in.nextToken();
    } nextToken {
        while (in == null || !in.hasMoreTokens()) {
            String s = br.readLine();
            if (s == null) return null;
            in = new StringTokenizer(s);
        }
        return in.nextToken();
    } while (in == null || !in.hasMoreTokens()) {
            String s = br.readLine();
            if (s == null) return null;
            in = new StringTokenizer(s);
        } in == null || !in.hasMoreTokens() in == null in null !in.hasMoreTokens() in.hasMoreTokens() in.hasMoreTokens in {
            String s = br.readLine();
            if (s == null) return null;
            in = new StringTokenizer(s);
        } String s = br.readLine(); s br.readLine() br.readLine br if (s == null) return null; s == null s null return null; null in = new StringTokenizer(s) in new StringTokenizer(s) return in.nextToken(); in.nextToken() in.nextToken in public static int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    } nextInt {
        return Integer.parseInt(nextToken());
    } return Integer.parseInt(nextToken()); Integer.parseInt(nextToken()) Integer.parseInt Integer nextToken() nextToken public static double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    } nextDouble {
        return Double.parseDouble(nextToken());
    } return Double.parseDouble(nextToken()); Double.parseDouble(nextToken()) Double.parseDouble Double nextToken() nextToken public static long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    } nextLong {
        return Long.parseLong(nextToken());
    } return Long.parseLong(nextToken()); Long.parseLong(nextToken()) Long.parseLong Long nextToken() nextToken public static void main(String[] args) throws IOException {
        run();
    } main {
        run();
    } run() run String[] args args static class mem {
        int to, val;
    } mem int to to val; val public class Main {

    static void run() throws IOException {
        file("", "");
        long time = System.currentTimeMillis();
//        int t = nextInt();
//        while (t-- > 0)
        solution();
        end(time);
    }

    static void solution() throws IOException {
        int n = nextInt();
        int k = nextInt();
        TreeSet<Integer> tr = new TreeSet<>();
        for (int i = 0; i < k; i++) {
            int l = nextInt();
            for (int j = 0; j < l; j++) {
                tr.add(nextInt());
            }
        }
        out.println(n-tr.size());
    }

    static mem create_mem(int to, int val) {
        mem y = new mem();
        y.to = to;
        y.val = val;
        return y;
    }

    static class mem {
        int to, val;
    }


    static void Z_function() throws IOException {
        char[] s = nextToken().toCharArray();
        int[] z = new int[s.length];
        for (int i = 1, l = 0, r = 0; i < s.length; i++) {
            if (i <= r)
                z[i] = min(r - i + 1, z[i - l]);
            while (z[i] + i < s.length && s[z[i] + i] == s[z[i]])
                ++z[i];
            if (i + z[i] - 1 > r) {
                l = i;
                r = i + z[i] - 1;
            }
        }
        for (int i = 0; i < z.length; i++) {
            out.print(z[i] + " ");
        }
    }

    static long pow(long a, long b) {
        long h = 1;
        while (b > 0) {
            if (b % 2 != 0) {
                h *= a;
                b--;
            }
            b /= 2;
            a *= a;
        }
        return h;
    }

    static long lcm(long a, long b) {
        return a * b / gcd(a, b);
    }

    static long gcd(long a, long b) {
        return b == 0 ? a : gcd(b, a % b);
    }

    static void end(long time) {
        out.flush();
        System.err.println("seconds : " + (System.currentTimeMillis() - time) / 1000 +
                "  milliseconds : " + (System.currentTimeMillis() - time) % 1000);
        out.close();
    }

    static BufferedReader br;
    static PrintWriter out;

    static void file(String input, String output) {
        if (input.equals("")) {
            br = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            try {
                br = new BufferedReader(new FileReader(input));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
            try {
                out = new PrintWriter(output);
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        }
    }

    static StringTokenizer in = new StringTokenizer("");

    public static String nextToken() throws IOException {
        while (in == null || !in.hasMoreTokens()) {
            String s = br.readLine();
            if (s == null) return null;
            in = new StringTokenizer(s);
        }
        return in.nextToken();
    }


    public static int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    public static double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }

    public static long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }


    public static void main(String[] args) throws IOException {
        run();
    }
} public class Main {

    static void run() throws IOException {
        file("", "");
        long time = System.currentTimeMillis();
//        int t = nextInt();
//        while (t-- > 0)
        solution();
        end(time);
    }

    static void solution() throws IOException {
        int n = nextInt();
        int k = nextInt();
        TreeSet<Integer> tr = new TreeSet<>();
        for (int i = 0; i < k; i++) {
            int l = nextInt();
            for (int j = 0; j < l; j++) {
                tr.add(nextInt());
            }
        }
        out.println(n-tr.size());
    }

    static mem create_mem(int to, int val) {
        mem y = new mem();
        y.to = to;
        y.val = val;
        return y;
    }

    static class mem {
        int to, val;
    }


    static void Z_function() throws IOException {
        char[] s = nextToken().toCharArray();
        int[] z = new int[s.length];
        for (int i = 1, l = 0, r = 0; i < s.length; i++) {
            if (i <= r)
                z[i] = min(r - i + 1, z[i - l]);
            while (z[i] + i < s.length && s[z[i] + i] == s[z[i]])
                ++z[i];
            if (i + z[i] - 1 > r) {
                l = i;
                r = i + z[i] - 1;
            }
        }
        for (int i = 0; i < z.length; i++) {
            out.print(z[i] + " ");
        }
    }

    static long pow(long a, long b) {
        long h = 1;
        while (b > 0) {
            if (b % 2 != 0) {
                h *= a;
                b--;
            }
            b /= 2;
            a *= a;
        }
        return h;
    }

    static long lcm(long a, long b) {
        return a * b / gcd(a, b);
    }

    static long gcd(long a, long b) {
        return b == 0 ? a : gcd(b, a % b);
    }

    static void end(long time) {
        out.flush();
        System.err.println("seconds : " + (System.currentTimeMillis() - time) / 1000 +
                "  milliseconds : " + (System.currentTimeMillis() - time) % 1000);
        out.close();
    }

    static BufferedReader br;
    static PrintWriter out;

    static void file(String input, String output) {
        if (input.equals("")) {
            br = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            try {
                br = new BufferedReader(new FileReader(input));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
            try {
                out = new PrintWriter(output);
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        }
    }

    static StringTokenizer in = new StringTokenizer("");

    public static String nextToken() throws IOException {
        while (in == null || !in.hasMoreTokens()) {
            String s = br.readLine();
            if (s == null) return null;
            in = new StringTokenizer(s);
        }
        return in.nextToken();
    }


    public static int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    public static double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }

    public static long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }


    public static void main(String[] args) throws IOException {
        run();
    }
} Main

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

import static java.lang.Math.*;
import static java.util.Arrays.fill;

public class Main {

    static void run() throws IOException {
        file("", "");
        long time = System.currentTimeMillis();
//        int t = nextInt();
//        while (t-- > 0)
        solution();
        end(time);
    }

    static void solution() throws IOException {
        int n = nextInt();
        int k = nextInt();
        TreeSet<Integer> tr = new TreeSet<>();
        for (int i = 0; i < k; i++) {
            int l = nextInt();
            for (int j = 0; j < l; j++) {
                tr.add(nextInt());
            }
        }
        out.println(n-tr.size());
    }

    static mem create_mem(int to, int val) {
        mem y = new mem();
        y.to = to;
        y.val = val;
        return y;
    }

    static class mem {
        int to, val;
    }


    static void Z_function() throws IOException {
        char[] s = nextToken().toCharArray();
        int[] z = new int[s.length];
        for (int i = 1, l = 0, r = 0; i < s.length; i++) {
            if (i <= r)
                z[i] = min(r - i + 1, z[i - l]);
            while (z[i] + i < s.length && s[z[i] + i] == s[z[i]])
                ++z[i];
            if (i + z[i] - 1 > r) {
                l = i;
                r = i + z[i] - 1;
            }
        }
        for (int i = 0; i < z.length; i++) {
            out.print(z[i] + " ");
        }
    }

    static long pow(long a, long b) {
        long h = 1;
        while (b > 0) {
            if (b % 2 != 0) {
                h *= a;
                b--;
            }
            b /= 2;
            a *= a;
        }
        return h;
    }

    static long lcm(long a, long b) {
        return a * b / gcd(a, b);
    }

    static long gcd(long a, long b) {
        return b == 0 ? a : gcd(b, a % b);
    }

    static void end(long time) {
        out.flush();
        System.err.println("seconds : " + (System.currentTimeMillis() - time) / 1000 +
                "  milliseconds : " + (System.currentTimeMillis() - time) % 1000);
        out.close();
    }

    static BufferedReader br;
    static PrintWriter out;

    static void file(String input, String output) {
        if (input.equals("")) {
            br = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            try {
                br = new BufferedReader(new FileReader(input));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
            try {
                out = new PrintWriter(output);
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        }
    }

    static StringTokenizer in = new StringTokenizer("");

    public static String nextToken() throws IOException {
        while (in == null || !in.hasMoreTokens()) {
            String s = br.readLine();
            if (s == null) return null;
            in = new StringTokenizer(s);
        }
        return in.nextToken();
    }


    public static int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    public static double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }

    public static long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }


    public static void main(String[] args) throws IOException {
        run();
    }
}