import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.util.*;

public class Main {
    static class Reader {
        final private int BUFFER_SIZE = 1 << 16;
        private DataInputStream din;
        private byte[] buffer;
        private int bufferPointer, bytesRead;

        public Reader() {
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public Reader(String file_name) throws IOException {
            din = new DataInputStream(new FileInputStream(file_name));
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public String readLine() throws IOException {
            byte[] buf = new byte[64]; // line length
            int cnt = 0, c;
            while ((c = read()) != -1) {
                if (c == '\n')
                    break;
                buf[cnt++] = (byte) c;
            }
            return new String(buf, 0, cnt);
        }

        public int nextInt() throws IOException {
            int ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');

            if (neg)
                return -ret;
            return ret;
        }

        public long nextLong() throws IOException {
            long ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');
            if (neg)
                return -ret;
            return ret;
        }

        public double nextDouble() throws IOException {
            double ret = 0, div = 1;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();

            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');

            if (c == '.') {
                while ((c = read()) >= '0' && c <= '9') {
                    ret += (c - '0') / (div *= 10);
                }
            }

            if (neg)
                return -ret;
            return ret;
        }

        private void fillBuffer() throws IOException {
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
            if (bytesRead == -1)
                buffer[0] = -1;
        }

        private byte read() throws IOException {
            if (bufferPointer == bytesRead)
                fillBuffer();
            return buffer[bufferPointer++];
        }

        public void close() throws IOException {
            if (din == null)
                return;
            din.close();
        }
    }

    static class Words {
        String word;
        int cost;

        public Words(String word) {
            this.word = word;
        }
    }

    static class Node {
        int key;
        int edgeweight;

        public Node(int key, int edgeweight) {
            this.key = key;
            this.edgeweight = edgeweight;
        }
    }

    static class Graph {
        int vertices;
        ArrayList<ArrayList<Node>> al;

        public Graph(int vertices) {
            this.vertices = vertices;
            al = new ArrayList<>(vertices);
            for (int i = 0; i < vertices; i++) {
                al.add(new ArrayList<Node>());
            }
        }

        public static void addEdgeUndirected(ArrayList<ArrayList<Node>> al, int source, int destination, int weight) {
            al.get(source).add(new Node(destination, weight));
            al.get(destination).add(new Node(destination, weight));
        }
       /* public static int bfs(ArrayList<ArrayList<Node>> al, int v, int root) {
            //here root means the starting vertex for bfs
            int count = 1;
            boolean[] visited = new boolean[v];
            Queue<Integer> q = new LinkedList<>();
            visited[root] = true;
            q.add(root);
            while (!q.isEmpty()) {
                int u = q.poll();
                for (int i = 0; i < al.get(u).size(); i++) {
                    if (!visited[al.get(u).get(i).key]) {
                        visited[al.get(u).get(i).key] = true;
                        q.add(al.get(u).get(i).key);
                        count++;
                    }
                }
            }
            return count;
        }*/
       public static void bfs(ArrayList<ArrayList<Node>> al, int v, int root) {
           //here root means the starting vertex for bfs
           boolean[] visited = new boolean[v];
           Queue<Integer> q = new LinkedList<>();
           visited[root] = true;
           q.add(root);
           while (!q.isEmpty()) {
               int u = q.poll();
               System.out.print(u + " ");
               for (int i = 0; i < al.get(u).size(); i++) {
                   if (!visited[al.get(u).get(i).key]) {
                       visited[al.get(u).get(i).key] = true;
                       q.add(al.get(u).get(i).key);
                   }
               }
           }
       }

    }
    public static void main(String[] args) throws IOException {
        Reader r = new Reader();
        int n = r.nextInt();
        int k = r.nextInt();
        HashSet<Integer> hs = new HashSet<>();
        while(k-->0){
            int temp = r.nextInt();
            for(int i=0;i<temp;i++) hs.add(r.nextInt());
        }
        System.out.println(n-hs.size());
        }
    }


 import java.io.DataInputStream; DataInputStream java.io import java.io.FileInputStream; FileInputStream java.io import java.io.IOException; IOException java.io import java.util.*; util.* java public class Main {
    static class Reader {
        final private int BUFFER_SIZE = 1 << 16;
        private DataInputStream din;
        private byte[] buffer;
        private int bufferPointer, bytesRead;

        public Reader() {
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public Reader(String file_name) throws IOException {
            din = new DataInputStream(new FileInputStream(file_name));
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public String readLine() throws IOException {
            byte[] buf = new byte[64]; // line length
            int cnt = 0, c;
            while ((c = read()) != -1) {
                if (c == '\n')
                    break;
                buf[cnt++] = (byte) c;
            }
            return new String(buf, 0, cnt);
        }

        public int nextInt() throws IOException {
            int ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');

            if (neg)
                return -ret;
            return ret;
        }

        public long nextLong() throws IOException {
            long ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');
            if (neg)
                return -ret;
            return ret;
        }

        public double nextDouble() throws IOException {
            double ret = 0, div = 1;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();

            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');

            if (c == '.') {
                while ((c = read()) >= '0' && c <= '9') {
                    ret += (c - '0') / (div *= 10);
                }
            }

            if (neg)
                return -ret;
            return ret;
        }

        private void fillBuffer() throws IOException {
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
            if (bytesRead == -1)
                buffer[0] = -1;
        }

        private byte read() throws IOException {
            if (bufferPointer == bytesRead)
                fillBuffer();
            return buffer[bufferPointer++];
        }

        public void close() throws IOException {
            if (din == null)
                return;
            din.close();
        }
    }

    static class Words {
        String word;
        int cost;

        public Words(String word) {
            this.word = word;
        }
    }

    static class Node {
        int key;
        int edgeweight;

        public Node(int key, int edgeweight) {
            this.key = key;
            this.edgeweight = edgeweight;
        }
    }

    static class Graph {
        int vertices;
        ArrayList<ArrayList<Node>> al;

        public Graph(int vertices) {
            this.vertices = vertices;
            al = new ArrayList<>(vertices);
            for (int i = 0; i < vertices; i++) {
                al.add(new ArrayList<Node>());
            }
        }

        public static void addEdgeUndirected(ArrayList<ArrayList<Node>> al, int source, int destination, int weight) {
            al.get(source).add(new Node(destination, weight));
            al.get(destination).add(new Node(destination, weight));
        }
       /* public static int bfs(ArrayList<ArrayList<Node>> al, int v, int root) {
            //here root means the starting vertex for bfs
            int count = 1;
            boolean[] visited = new boolean[v];
            Queue<Integer> q = new LinkedList<>();
            visited[root] = true;
            q.add(root);
            while (!q.isEmpty()) {
                int u = q.poll();
                for (int i = 0; i < al.get(u).size(); i++) {
                    if (!visited[al.get(u).get(i).key]) {
                        visited[al.get(u).get(i).key] = true;
                        q.add(al.get(u).get(i).key);
                        count++;
                    }
                }
            }
            return count;
        }*/
       public static void bfs(ArrayList<ArrayList<Node>> al, int v, int root) {
           //here root means the starting vertex for bfs
           boolean[] visited = new boolean[v];
           Queue<Integer> q = new LinkedList<>();
           visited[root] = true;
           q.add(root);
           while (!q.isEmpty()) {
               int u = q.poll();
               System.out.print(u + " ");
               for (int i = 0; i < al.get(u).size(); i++) {
                   if (!visited[al.get(u).get(i).key]) {
                       visited[al.get(u).get(i).key] = true;
                       q.add(al.get(u).get(i).key);
                   }
               }
           }
       }

    }
    public static void main(String[] args) throws IOException {
        Reader r = new Reader();
        int n = r.nextInt();
        int k = r.nextInt();
        HashSet<Integer> hs = new HashSet<>();
        while(k-->0){
            int temp = r.nextInt();
            for(int i=0;i<temp;i++) hs.add(r.nextInt());
        }
        System.out.println(n-hs.size());
        }
    } Main public static void main(String[] args) throws IOException {
        Reader r = new Reader();
        int n = r.nextInt();
        int k = r.nextInt();
        HashSet<Integer> hs = new HashSet<>();
        while(k-->0){
            int temp = r.nextInt();
            for(int i=0;i<temp;i++) hs.add(r.nextInt());
        }
        System.out.println(n-hs.size());
        } main {
        Reader r = new Reader();
        int n = r.nextInt();
        int k = r.nextInt();
        HashSet<Integer> hs = new HashSet<>();
        while(k-->0){
            int temp = r.nextInt();
            for(int i=0;i<temp;i++) hs.add(r.nextInt());
        }
        System.out.println(n-hs.size());
        } Reader r = new Reader(); r new Reader() int n = r.nextInt(); n r.nextInt() r.nextInt r int k = r.nextInt(); k r.nextInt() r.nextInt r HashSet<Integer> hs = new HashSet<>(); hs new HashSet<>() while(k-->0){
            int temp = r.nextInt();
            for(int i=0;i<temp;i++) hs.add(r.nextInt());
        } k-->0 k-- k 0 {
            int temp = r.nextInt();
            for(int i=0;i<temp;i++) hs.add(r.nextInt());
        } int temp = r.nextInt(); temp r.nextInt() r.nextInt r for(int i=0;i<temp;i++) hs.add(r.nextInt()); int i=0; int i=0; i 0 i<temp i temp i++ i++ i hs.add(r.nextInt()); hs.add(r.nextInt()) hs.add hs r.nextInt() r.nextInt r System.out.println(n-hs.size()) System.out.println System.out System System.out n-hs.size() n hs.size() hs.size hs String[] args args static class Reader {
        final private int BUFFER_SIZE = 1 << 16;
        private DataInputStream din;
        private byte[] buffer;
        private int bufferPointer, bytesRead;

        public Reader() {
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public Reader(String file_name) throws IOException {
            din = new DataInputStream(new FileInputStream(file_name));
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public String readLine() throws IOException {
            byte[] buf = new byte[64]; // line length
            int cnt = 0, c;
            while ((c = read()) != -1) {
                if (c == '\n')
                    break;
                buf[cnt++] = (byte) c;
            }
            return new String(buf, 0, cnt);
        }

        public int nextInt() throws IOException {
            int ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');

            if (neg)
                return -ret;
            return ret;
        }

        public long nextLong() throws IOException {
            long ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');
            if (neg)
                return -ret;
            return ret;
        }

        public double nextDouble() throws IOException {
            double ret = 0, div = 1;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();

            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');

            if (c == '.') {
                while ((c = read()) >= '0' && c <= '9') {
                    ret += (c - '0') / (div *= 10);
                }
            }

            if (neg)
                return -ret;
            return ret;
        }

        private void fillBuffer() throws IOException {
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
            if (bytesRead == -1)
                buffer[0] = -1;
        }

        private byte read() throws IOException {
            if (bufferPointer == bytesRead)
                fillBuffer();
            return buffer[bufferPointer++];
        }

        public void close() throws IOException {
            if (din == null)
                return;
            din.close();
        }
    } Reader final private int BUFFER_SIZE = 1 << 16; BUFFER_SIZE 1 << 16 1 16 private DataInputStream din; din private byte[] buffer; buffer private int bufferPointer bufferPointer bytesRead; bytesRead public Reader() {
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        } Reader {
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        } din = new DataInputStream(System.in) din new DataInputStream(System.in) buffer = new byte[BUFFER_SIZE] buffer new byte[BUFFER_SIZE] BUFFER_SIZE bufferPointer = bytesRead = 0 bufferPointer bytesRead = 0 bytesRead 0 public Reader(String file_name) throws IOException {
            din = new DataInputStream(new FileInputStream(file_name));
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        } Reader {
            din = new DataInputStream(new FileInputStream(file_name));
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        } din = new DataInputStream(new FileInputStream(file_name)) din new DataInputStream(new FileInputStream(file_name)) buffer = new byte[BUFFER_SIZE] buffer new byte[BUFFER_SIZE] BUFFER_SIZE bufferPointer = bytesRead = 0 bufferPointer bytesRead = 0 bytesRead 0 String file_name file_name public String readLine() throws IOException {
            byte[] buf = new byte[64]; // line length
            int cnt = 0, c;
            while ((c = read()) != -1) {
                if (c == '\n')
                    break;
                buf[cnt++] = (byte) c;
            }
            return new String(buf, 0, cnt);
        } readLine {
            byte[] buf = new byte[64]; // line length
            int cnt = 0, c;
            while ((c = read()) != -1) {
                if (c == '\n')
                    break;
                buf[cnt++] = (byte) c;
            }
            return new String(buf, 0, cnt);
        } byte[] buf = new byte[64]; buf new byte[64] 64 int cnt = 0 cnt 0 c; c while ((c = read()) != -1) {
                if (c == '\n')
                    break;
                buf[cnt++] = (byte) c;
            } (c = read()) != -1 (c = read()) c read() read -1 1 {
                if (c == '\n')
                    break;
                buf[cnt++] = (byte) c;
            } if (c == '\n')
                    break; c == '\n' c '\n' break; buf[cnt++] = (byte) c buf[cnt++] buf cnt++ cnt (byte) c return new String(buf, 0, cnt); new String(buf, 0, cnt) public int nextInt() throws IOException {
            int ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');

            if (neg)
                return -ret;
            return ret;
        } nextInt {
            int ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');

            if (neg)
                return -ret;
            return ret;
        } int ret = 0; ret 0 byte c = read(); c read() read while (c <= ' ')
                c = read(); c <= ' ' c ' ' c = read() c read() read boolean neg = (c == '-'); neg (c == '-') c '-' if (neg)
                c = read(); neg c = read() c read() read do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9'); (c = read()) >= '0' && c <= '9' (c = read()) >= '0' (c = read()) c read() read '0' c <= '9' c '9' {
                ret = ret * 10 + c - '0';
            } ret = ret * 10 + c - '0' ret ret * 10 + c - '0' ret * 10 + c ret * 10 ret 10 c '0' if (neg)
                return -ret; neg return -ret; -ret ret return ret; ret public long nextLong() throws IOException {
            long ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');
            if (neg)
                return -ret;
            return ret;
        } nextLong {
            long ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');
            if (neg)
                return -ret;
            return ret;
        } long ret = 0; ret 0 byte c = read(); c read() read while (c <= ' ')
                c = read(); c <= ' ' c ' ' c = read() c read() read boolean neg = (c == '-'); neg (c == '-') c '-' if (neg)
                c = read(); neg c = read() c read() read do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9'); (c = read()) >= '0' && c <= '9' (c = read()) >= '0' (c = read()) c read() read '0' c <= '9' c '9' {
                ret = ret * 10 + c - '0';
            } ret = ret * 10 + c - '0' ret ret * 10 + c - '0' ret * 10 + c ret * 10 ret 10 c '0' if (neg)
                return -ret; neg return -ret; -ret ret return ret; ret public double nextDouble() throws IOException {
            double ret = 0, div = 1;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();

            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');

            if (c == '.') {
                while ((c = read()) >= '0' && c <= '9') {
                    ret += (c - '0') / (div *= 10);
                }
            }

            if (neg)
                return -ret;
            return ret;
        } nextDouble {
            double ret = 0, div = 1;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();

            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');

            if (c == '.') {
                while ((c = read()) >= '0' && c <= '9') {
                    ret += (c - '0') / (div *= 10);
                }
            }

            if (neg)
                return -ret;
            return ret;
        } double ret = 0 ret 0 div = 1; div 1 byte c = read(); c read() read while (c <= ' ')
                c = read(); c <= ' ' c ' ' c = read() c read() read boolean neg = (c == '-'); neg (c == '-') c '-' if (neg)
                c = read(); neg c = read() c read() read do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9'); (c = read()) >= '0' && c <= '9' (c = read()) >= '0' (c = read()) c read() read '0' c <= '9' c '9' {
                ret = ret * 10 + c - '0';
            } ret = ret * 10 + c - '0' ret ret * 10 + c - '0' ret * 10 + c ret * 10 ret 10 c '0' if (c == '.') {
                while ((c = read()) >= '0' && c <= '9') {
                    ret += (c - '0') / (div *= 10);
                }
            } c == '.' c '.' {
                while ((c = read()) >= '0' && c <= '9') {
                    ret += (c - '0') / (div *= 10);
                }
            } while ((c = read()) >= '0' && c <= '9') {
                    ret += (c - '0') / (div *= 10);
                } (c = read()) >= '0' && c <= '9' (c = read()) >= '0' (c = read()) c read() read '0' c <= '9' c '9' {
                    ret += (c - '0') / (div *= 10);
                } ret += (c - '0') / (div *= 10) ret (c - '0') / (div *= 10) (c - '0') c '0' (div *= 10) div 10 if (neg)
                return -ret; neg return -ret; -ret ret return ret; ret private void fillBuffer() throws IOException {
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
            if (bytesRead == -1)
                buffer[0] = -1;
        } fillBuffer {
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
            if (bytesRead == -1)
                buffer[0] = -1;
        } bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE) bytesRead din.read(buffer, bufferPointer = 0, BUFFER_SIZE) din.read din buffer bufferPointer = 0 bufferPointer 0 BUFFER_SIZE if (bytesRead == -1)
                buffer[0] = -1; bytesRead == -1 bytesRead -1 1 buffer[0] = -1 buffer[0] buffer 0 -1 1 private byte read() throws IOException {
            if (bufferPointer == bytesRead)
                fillBuffer();
            return buffer[bufferPointer++];
        } read {
            if (bufferPointer == bytesRead)
                fillBuffer();
            return buffer[bufferPointer++];
        } if (bufferPointer == bytesRead)
                fillBuffer(); bufferPointer == bytesRead bufferPointer bytesRead fillBuffer() fillBuffer return buffer[bufferPointer++]; buffer[bufferPointer++] buffer bufferPointer++ bufferPointer public void close() throws IOException {
            if (din == null)
                return;
            din.close();
        } close {
            if (din == null)
                return;
            din.close();
        } if (din == null)
                return; din == null din null return; din.close() din.close din static class Words {
        String word;
        int cost;

        public Words(String word) {
            this.word = word;
        }
    } Words String word; word int cost; cost public Words(String word) {
            this.word = word;
        } Words {
            this.word = word;
        } this.word = word this.word this this.word word String word word static class Node {
        int key;
        int edgeweight;

        public Node(int key, int edgeweight) {
            this.key = key;
            this.edgeweight = edgeweight;
        }
    } Node int key; key int edgeweight; edgeweight public Node(int key, int edgeweight) {
            this.key = key;
            this.edgeweight = edgeweight;
        } Node {
            this.key = key;
            this.edgeweight = edgeweight;
        } this.key = key this.key this this.key key this.edgeweight = edgeweight this.edgeweight this this.edgeweight edgeweight int key key int edgeweight edgeweight static class Graph {
        int vertices;
        ArrayList<ArrayList<Node>> al;

        public Graph(int vertices) {
            this.vertices = vertices;
            al = new ArrayList<>(vertices);
            for (int i = 0; i < vertices; i++) {
                al.add(new ArrayList<Node>());
            }
        }

        public static void addEdgeUndirected(ArrayList<ArrayList<Node>> al, int source, int destination, int weight) {
            al.get(source).add(new Node(destination, weight));
            al.get(destination).add(new Node(destination, weight));
        }
       /* public static int bfs(ArrayList<ArrayList<Node>> al, int v, int root) {
            //here root means the starting vertex for bfs
            int count = 1;
            boolean[] visited = new boolean[v];
            Queue<Integer> q = new LinkedList<>();
            visited[root] = true;
            q.add(root);
            while (!q.isEmpty()) {
                int u = q.poll();
                for (int i = 0; i < al.get(u).size(); i++) {
                    if (!visited[al.get(u).get(i).key]) {
                        visited[al.get(u).get(i).key] = true;
                        q.add(al.get(u).get(i).key);
                        count++;
                    }
                }
            }
            return count;
        }*/
       public static void bfs(ArrayList<ArrayList<Node>> al, int v, int root) {
           //here root means the starting vertex for bfs
           boolean[] visited = new boolean[v];
           Queue<Integer> q = new LinkedList<>();
           visited[root] = true;
           q.add(root);
           while (!q.isEmpty()) {
               int u = q.poll();
               System.out.print(u + " ");
               for (int i = 0; i < al.get(u).size(); i++) {
                   if (!visited[al.get(u).get(i).key]) {
                       visited[al.get(u).get(i).key] = true;
                       q.add(al.get(u).get(i).key);
                   }
               }
           }
       }

    } Graph int vertices; vertices ArrayList<ArrayList<Node>> al; al public Graph(int vertices) {
            this.vertices = vertices;
            al = new ArrayList<>(vertices);
            for (int i = 0; i < vertices; i++) {
                al.add(new ArrayList<Node>());
            }
        } Graph {
            this.vertices = vertices;
            al = new ArrayList<>(vertices);
            for (int i = 0; i < vertices; i++) {
                al.add(new ArrayList<Node>());
            }
        } this.vertices = vertices this.vertices this this.vertices vertices al = new ArrayList<>(vertices) al new ArrayList<>(vertices) for (int i = 0; i < vertices; i++) {
                al.add(new ArrayList<Node>());
            } int i = 0; int i = 0; i 0 i < vertices i vertices i++ i++ i {
                al.add(new ArrayList<Node>());
            } {
                al.add(new ArrayList<Node>());
            } al.add(new ArrayList<Node>()) al.add al new ArrayList<Node>() int vertices vertices public static void addEdgeUndirected(ArrayList<ArrayList<Node>> al, int source, int destination, int weight) {
            al.get(source).add(new Node(destination, weight));
            al.get(destination).add(new Node(destination, weight));
        } addEdgeUndirected {
            al.get(source).add(new Node(destination, weight));
            al.get(destination).add(new Node(destination, weight));
        } al.get(source).add(new Node(destination, weight)) al.get(source).add al.get(source) al.get al source new Node(destination, weight) al.get(destination).add(new Node(destination, weight)) al.get(destination).add al.get(destination) al.get al destination new Node(destination, weight) ArrayList<ArrayList<Node>> al al int source source int destination destination int weight weight /* public static int bfs(ArrayList<ArrayList<Node>> al, int v, int root) {
            //here root means the starting vertex for bfs
            int count = 1;
            boolean[] visited = new boolean[v];
            Queue<Integer> q = new LinkedList<>();
            visited[root] = true;
            q.add(root);
            while (!q.isEmpty()) {
                int u = q.poll();
                for (int i = 0; i < al.get(u).size(); i++) {
                    if (!visited[al.get(u).get(i).key]) {
                        visited[al.get(u).get(i).key] = true;
                        q.add(al.get(u).get(i).key);
                        count++;
                    }
                }
            }
            return count;
        }*/
       public static void bfs(ArrayList<ArrayList<Node>> al, int v, int root) {
           //here root means the starting vertex for bfs
           boolean[] visited = new boolean[v];
           Queue<Integer> q = new LinkedList<>();
           visited[root] = true;
           q.add(root);
           while (!q.isEmpty()) {
               int u = q.poll();
               System.out.print(u + " ");
               for (int i = 0; i < al.get(u).size(); i++) {
                   if (!visited[al.get(u).get(i).key]) {
                       visited[al.get(u).get(i).key] = true;
                       q.add(al.get(u).get(i).key);
                   }
               }
           }
       } bfs {
           //here root means the starting vertex for bfs
           boolean[] visited = new boolean[v];
           Queue<Integer> q = new LinkedList<>();
           visited[root] = true;
           q.add(root);
           while (!q.isEmpty()) {
               int u = q.poll();
               System.out.print(u + " ");
               for (int i = 0; i < al.get(u).size(); i++) {
                   if (!visited[al.get(u).get(i).key]) {
                       visited[al.get(u).get(i).key] = true;
                       q.add(al.get(u).get(i).key);
                   }
               }
           }
       } boolean[] visited = new boolean[v]; visited new boolean[v] v Queue<Integer> q = new LinkedList<>(); q new LinkedList<>() visited[root] = true visited[root] visited root true q.add(root) q.add q root while (!q.isEmpty()) {
               int u = q.poll();
               System.out.print(u + " ");
               for (int i = 0; i < al.get(u).size(); i++) {
                   if (!visited[al.get(u).get(i).key]) {
                       visited[al.get(u).get(i).key] = true;
                       q.add(al.get(u).get(i).key);
                   }
               }
           } !q.isEmpty() q.isEmpty() q.isEmpty q {
               int u = q.poll();
               System.out.print(u + " ");
               for (int i = 0; i < al.get(u).size(); i++) {
                   if (!visited[al.get(u).get(i).key]) {
                       visited[al.get(u).get(i).key] = true;
                       q.add(al.get(u).get(i).key);
                   }
               }
           } int u = q.poll(); u q.poll() q.poll q System.out.print(u + " ") System.out.print System.out System System.out u + " " u " " for (int i = 0; i < al.get(u).size(); i++) {
                   if (!visited[al.get(u).get(i).key]) {
                       visited[al.get(u).get(i).key] = true;
                       q.add(al.get(u).get(i).key);
                   }
               } int i = 0; int i = 0; i 0 i < al.get(u).size() i al.get(u).size() al.get(u).size al.get(u) al.get al u i++ i++ i {
                   if (!visited[al.get(u).get(i).key]) {
                       visited[al.get(u).get(i).key] = true;
                       q.add(al.get(u).get(i).key);
                   }
               } {
                   if (!visited[al.get(u).get(i).key]) {
                       visited[al.get(u).get(i).key] = true;
                       q.add(al.get(u).get(i).key);
                   }
               } if (!visited[al.get(u).get(i).key]) {
                       visited[al.get(u).get(i).key] = true;
                       q.add(al.get(u).get(i).key);
                   } !visited[al.get(u).get(i).key] visited[al.get(u).get(i).key] visited al.get(u).get(i).key al.get(u).get(i) al.get(u).get al.get(u) al.get al u i al.get(u).get(i).key {
                       visited[al.get(u).get(i).key] = true;
                       q.add(al.get(u).get(i).key);
                   } visited[al.get(u).get(i).key] = true visited[al.get(u).get(i).key] visited al.get(u).get(i).key al.get(u).get(i) al.get(u).get al.get(u) al.get al u i al.get(u).get(i).key true q.add(al.get(u).get(i).key) q.add q al.get(u).get(i).key al.get(u).get(i) al.get(u).get al.get(u) al.get al u i al.get(u).get(i).key ArrayList<ArrayList<Node>> al al int v v int root root public class Main {
    static class Reader {
        final private int BUFFER_SIZE = 1 << 16;
        private DataInputStream din;
        private byte[] buffer;
        private int bufferPointer, bytesRead;

        public Reader() {
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public Reader(String file_name) throws IOException {
            din = new DataInputStream(new FileInputStream(file_name));
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public String readLine() throws IOException {
            byte[] buf = new byte[64]; // line length
            int cnt = 0, c;
            while ((c = read()) != -1) {
                if (c == '\n')
                    break;
                buf[cnt++] = (byte) c;
            }
            return new String(buf, 0, cnt);
        }

        public int nextInt() throws IOException {
            int ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');

            if (neg)
                return -ret;
            return ret;
        }

        public long nextLong() throws IOException {
            long ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');
            if (neg)
                return -ret;
            return ret;
        }

        public double nextDouble() throws IOException {
            double ret = 0, div = 1;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();

            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');

            if (c == '.') {
                while ((c = read()) >= '0' && c <= '9') {
                    ret += (c - '0') / (div *= 10);
                }
            }

            if (neg)
                return -ret;
            return ret;
        }

        private void fillBuffer() throws IOException {
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
            if (bytesRead == -1)
                buffer[0] = -1;
        }

        private byte read() throws IOException {
            if (bufferPointer == bytesRead)
                fillBuffer();
            return buffer[bufferPointer++];
        }

        public void close() throws IOException {
            if (din == null)
                return;
            din.close();
        }
    }

    static class Words {
        String word;
        int cost;

        public Words(String word) {
            this.word = word;
        }
    }

    static class Node {
        int key;
        int edgeweight;

        public Node(int key, int edgeweight) {
            this.key = key;
            this.edgeweight = edgeweight;
        }
    }

    static class Graph {
        int vertices;
        ArrayList<ArrayList<Node>> al;

        public Graph(int vertices) {
            this.vertices = vertices;
            al = new ArrayList<>(vertices);
            for (int i = 0; i < vertices; i++) {
                al.add(new ArrayList<Node>());
            }
        }

        public static void addEdgeUndirected(ArrayList<ArrayList<Node>> al, int source, int destination, int weight) {
            al.get(source).add(new Node(destination, weight));
            al.get(destination).add(new Node(destination, weight));
        }
       /* public static int bfs(ArrayList<ArrayList<Node>> al, int v, int root) {
            //here root means the starting vertex for bfs
            int count = 1;
            boolean[] visited = new boolean[v];
            Queue<Integer> q = new LinkedList<>();
            visited[root] = true;
            q.add(root);
            while (!q.isEmpty()) {
                int u = q.poll();
                for (int i = 0; i < al.get(u).size(); i++) {
                    if (!visited[al.get(u).get(i).key]) {
                        visited[al.get(u).get(i).key] = true;
                        q.add(al.get(u).get(i).key);
                        count++;
                    }
                }
            }
            return count;
        }*/
       public static void bfs(ArrayList<ArrayList<Node>> al, int v, int root) {
           //here root means the starting vertex for bfs
           boolean[] visited = new boolean[v];
           Queue<Integer> q = new LinkedList<>();
           visited[root] = true;
           q.add(root);
           while (!q.isEmpty()) {
               int u = q.poll();
               System.out.print(u + " ");
               for (int i = 0; i < al.get(u).size(); i++) {
                   if (!visited[al.get(u).get(i).key]) {
                       visited[al.get(u).get(i).key] = true;
                       q.add(al.get(u).get(i).key);
                   }
               }
           }
       }

    }
    public static void main(String[] args) throws IOException {
        Reader r = new Reader();
        int n = r.nextInt();
        int k = r.nextInt();
        HashSet<Integer> hs = new HashSet<>();
        while(k-->0){
            int temp = r.nextInt();
            for(int i=0;i<temp;i++) hs.add(r.nextInt());
        }
        System.out.println(n-hs.size());
        }
    } public class Main {
    static class Reader {
        final private int BUFFER_SIZE = 1 << 16;
        private DataInputStream din;
        private byte[] buffer;
        private int bufferPointer, bytesRead;

        public Reader() {
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public Reader(String file_name) throws IOException {
            din = new DataInputStream(new FileInputStream(file_name));
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public String readLine() throws IOException {
            byte[] buf = new byte[64]; // line length
            int cnt = 0, c;
            while ((c = read()) != -1) {
                if (c == '\n')
                    break;
                buf[cnt++] = (byte) c;
            }
            return new String(buf, 0, cnt);
        }

        public int nextInt() throws IOException {
            int ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');

            if (neg)
                return -ret;
            return ret;
        }

        public long nextLong() throws IOException {
            long ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');
            if (neg)
                return -ret;
            return ret;
        }

        public double nextDouble() throws IOException {
            double ret = 0, div = 1;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();

            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');

            if (c == '.') {
                while ((c = read()) >= '0' && c <= '9') {
                    ret += (c - '0') / (div *= 10);
                }
            }

            if (neg)
                return -ret;
            return ret;
        }

        private void fillBuffer() throws IOException {
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
            if (bytesRead == -1)
                buffer[0] = -1;
        }

        private byte read() throws IOException {
            if (bufferPointer == bytesRead)
                fillBuffer();
            return buffer[bufferPointer++];
        }

        public void close() throws IOException {
            if (din == null)
                return;
            din.close();
        }
    }

    static class Words {
        String word;
        int cost;

        public Words(String word) {
            this.word = word;
        }
    }

    static class Node {
        int key;
        int edgeweight;

        public Node(int key, int edgeweight) {
            this.key = key;
            this.edgeweight = edgeweight;
        }
    }

    static class Graph {
        int vertices;
        ArrayList<ArrayList<Node>> al;

        public Graph(int vertices) {
            this.vertices = vertices;
            al = new ArrayList<>(vertices);
            for (int i = 0; i < vertices; i++) {
                al.add(new ArrayList<Node>());
            }
        }

        public static void addEdgeUndirected(ArrayList<ArrayList<Node>> al, int source, int destination, int weight) {
            al.get(source).add(new Node(destination, weight));
            al.get(destination).add(new Node(destination, weight));
        }
       /* public static int bfs(ArrayList<ArrayList<Node>> al, int v, int root) {
            //here root means the starting vertex for bfs
            int count = 1;
            boolean[] visited = new boolean[v];
            Queue<Integer> q = new LinkedList<>();
            visited[root] = true;
            q.add(root);
            while (!q.isEmpty()) {
                int u = q.poll();
                for (int i = 0; i < al.get(u).size(); i++) {
                    if (!visited[al.get(u).get(i).key]) {
                        visited[al.get(u).get(i).key] = true;
                        q.add(al.get(u).get(i).key);
                        count++;
                    }
                }
            }
            return count;
        }*/
       public static void bfs(ArrayList<ArrayList<Node>> al, int v, int root) {
           //here root means the starting vertex for bfs
           boolean[] visited = new boolean[v];
           Queue<Integer> q = new LinkedList<>();
           visited[root] = true;
           q.add(root);
           while (!q.isEmpty()) {
               int u = q.poll();
               System.out.print(u + " ");
               for (int i = 0; i < al.get(u).size(); i++) {
                   if (!visited[al.get(u).get(i).key]) {
                       visited[al.get(u).get(i).key] = true;
                       q.add(al.get(u).get(i).key);
                   }
               }
           }
       }

    }
    public static void main(String[] args) throws IOException {
        Reader r = new Reader();
        int n = r.nextInt();
        int k = r.nextInt();
        HashSet<Integer> hs = new HashSet<>();
        while(k-->0){
            int temp = r.nextInt();
            for(int i=0;i<temp;i++) hs.add(r.nextInt());
        }
        System.out.println(n-hs.size());
        }
    } Main
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.util.*;

public class Main {
    static class Reader {
        final private int BUFFER_SIZE = 1 << 16;
        private DataInputStream din;
        private byte[] buffer;
        private int bufferPointer, bytesRead;

        public Reader() {
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public Reader(String file_name) throws IOException {
            din = new DataInputStream(new FileInputStream(file_name));
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public String readLine() throws IOException {
            byte[] buf = new byte[64]; // line length
            int cnt = 0, c;
            while ((c = read()) != -1) {
                if (c == '\n')
                    break;
                buf[cnt++] = (byte) c;
            }
            return new String(buf, 0, cnt);
        }

        public int nextInt() throws IOException {
            int ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');

            if (neg)
                return -ret;
            return ret;
        }

        public long nextLong() throws IOException {
            long ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');
            if (neg)
                return -ret;
            return ret;
        }

        public double nextDouble() throws IOException {
            double ret = 0, div = 1;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();

            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');

            if (c == '.') {
                while ((c = read()) >= '0' && c <= '9') {
                    ret += (c - '0') / (div *= 10);
                }
            }

            if (neg)
                return -ret;
            return ret;
        }

        private void fillBuffer() throws IOException {
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
            if (bytesRead == -1)
                buffer[0] = -1;
        }

        private byte read() throws IOException {
            if (bufferPointer == bytesRead)
                fillBuffer();
            return buffer[bufferPointer++];
        }

        public void close() throws IOException {
            if (din == null)
                return;
            din.close();
        }
    }

    static class Words {
        String word;
        int cost;

        public Words(String word) {
            this.word = word;
        }
    }

    static class Node {
        int key;
        int edgeweight;

        public Node(int key, int edgeweight) {
            this.key = key;
            this.edgeweight = edgeweight;
        }
    }

    static class Graph {
        int vertices;
        ArrayList<ArrayList<Node>> al;

        public Graph(int vertices) {
            this.vertices = vertices;
            al = new ArrayList<>(vertices);
            for (int i = 0; i < vertices; i++) {
                al.add(new ArrayList<Node>());
            }
        }

        public static void addEdgeUndirected(ArrayList<ArrayList<Node>> al, int source, int destination, int weight) {
            al.get(source).add(new Node(destination, weight));
            al.get(destination).add(new Node(destination, weight));
        }
       /* public static int bfs(ArrayList<ArrayList<Node>> al, int v, int root) {
            //here root means the starting vertex for bfs
            int count = 1;
            boolean[] visited = new boolean[v];
            Queue<Integer> q = new LinkedList<>();
            visited[root] = true;
            q.add(root);
            while (!q.isEmpty()) {
                int u = q.poll();
                for (int i = 0; i < al.get(u).size(); i++) {
                    if (!visited[al.get(u).get(i).key]) {
                        visited[al.get(u).get(i).key] = true;
                        q.add(al.get(u).get(i).key);
                        count++;
                    }
                }
            }
            return count;
        }*/
       public static void bfs(ArrayList<ArrayList<Node>> al, int v, int root) {
           //here root means the starting vertex for bfs
           boolean[] visited = new boolean[v];
           Queue<Integer> q = new LinkedList<>();
           visited[root] = true;
           q.add(root);
           while (!q.isEmpty()) {
               int u = q.poll();
               System.out.print(u + " ");
               for (int i = 0; i < al.get(u).size(); i++) {
                   if (!visited[al.get(u).get(i).key]) {
                       visited[al.get(u).get(i).key] = true;
                       q.add(al.get(u).get(i).key);
                   }
               }
           }
       }

    }
    public static void main(String[] args) throws IOException {
        Reader r = new Reader();
        int n = r.nextInt();
        int k = r.nextInt();
        HashSet<Integer> hs = new HashSet<>();
        while(k-->0){
            int temp = r.nextInt();
            for(int i=0;i<temp;i++) hs.add(r.nextInt());
        }
        System.out.println(n-hs.size());
        }
    }



