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

import java.util.*;

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

    static class Hola {
        PrintWriter out;
        InputReader in;
        long mod = (long)1e9 + 7;
        int MAXN = (int)2e5 + 5;
        int[] segtree;
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            this.out = out;
            this.in = in;
            int n = ni();
            int k = ni();
            int[] cnt = new int[n + 1];
            int i = 0;
            for(i = 0; i < k; i++) {
                int x = ni();
                for(int j = 0; j < x; j++)
                    cnt[ni()]++;
            }
            int c = 0;
            for(i = 1; i <= n; i++){
                if(cnt[i] == 0)
                    c++;
            }
            pn(c);
        }


        void sort(int[] A){
            PriorityQueue<Integer> pq = new PriorityQueue();
            int i = 0;
            for(i = 0; i < A.length; i++)
                pq.add(A[i]);
            for(i = 0; i < A.length; i++)
                A[i] = pq.poll();
        }
        int gcd(int a, int b)
        {
            if (a == 0)
                return b;

            return gcd(b%a, a);
        }
        long mul(long a,long b){
            if(a>=mod)a%=mod;
            if(b>=mod)b%=mod;
            a*=b;
            if(a>=mod)a%=mod;
            return a;
        }
        long modPow(long a, long p){
            long o = 1;
            while(p>0){
                if((p&1)==1)o = mul(o,a);
                a = mul(a,a);
                p>>=1;
            }
            return o;
        }
        final Comparator<Tuple> com = new Comparator<Tuple>() {
            @Override
            public int compare(Tuple t1, Tuple t2) {
                if(t1.x != t2.x)
                    return Long.compare(t1.x, t2.x);
                else
                    return Long.compare(t1.y, t2.y);
            }
        };
        class Tuple{
            int x, y, z;
            Tuple(int x, int y){
                this.x = x;
                this.y = y;
            }
        }
        int ni() {
            return in.nextInt();
        }
        long nl() {
            return in.nextLong();
        }
        void pn(Object o) {
            out.println(o);
        }
        void p(Object o) {
            out.print(o);
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new UnknownError();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new UnknownError();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
            return Long.parseLong(next());
        }

        public String next() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuffer res = new StringBuffer();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));

            return res.toString();
        }

        private boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

    }
} Comparator<Tuple>() {
            @Override
            public int compare(Tuple t1, Tuple t2) {
                if(t1.x != t2.x)
                    return Long.compare(t1.x, t2.x);
                else
                    return Long.compare(t1.y, t2.y);
            }
        } @Override
            public int compare(Tuple t1, Tuple t2) {
                if(t1.x != t2.x)
                    return Long.compare(t1.x, t2.x);
                else
                    return Long.compare(t1.y, t2.y);
            } compare {
                if(t1.x != t2.x)
                    return Long.compare(t1.x, t2.x);
                else
                    return Long.compare(t1.y, t2.y);
            } if(t1.x != t2.x)
                    return Long.compare(t1.x, t2.x);
                else
                    return Long.compare(t1.y, t2.y); t1.x != t2.x t1.x t1 t1.x t2.x t2 t2.x return Long.compare(t1.x, t2.x); Long.compare(t1.x, t2.x) Long.compare Long t1.x t1 t1.x t2.x t2 t2.x return Long.compare(t1.y, t2.y); Long.compare(t1.y, t2.y) Long.compare Long t1.y t1 t1.y t2.y t2 t2.y Tuple t1 t1 Tuple t2 t2 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.HashMap; HashMap java.util import java.util.*; util.* java public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Hola solver = new Hola();
        solver.solve(1, in, out);
        out.close();
    }

    static class Hola {
        PrintWriter out;
        InputReader in;
        long mod = (long)1e9 + 7;
        int MAXN = (int)2e5 + 5;
        int[] segtree;
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            this.out = out;
            this.in = in;
            int n = ni();
            int k = ni();
            int[] cnt = new int[n + 1];
            int i = 0;
            for(i = 0; i < k; i++) {
                int x = ni();
                for(int j = 0; j < x; j++)
                    cnt[ni()]++;
            }
            int c = 0;
            for(i = 1; i <= n; i++){
                if(cnt[i] == 0)
                    c++;
            }
            pn(c);
        }


        void sort(int[] A){
            PriorityQueue<Integer> pq = new PriorityQueue();
            int i = 0;
            for(i = 0; i < A.length; i++)
                pq.add(A[i]);
            for(i = 0; i < A.length; i++)
                A[i] = pq.poll();
        }
        int gcd(int a, int b)
        {
            if (a == 0)
                return b;

            return gcd(b%a, a);
        }
        long mul(long a,long b){
            if(a>=mod)a%=mod;
            if(b>=mod)b%=mod;
            a*=b;
            if(a>=mod)a%=mod;
            return a;
        }
        long modPow(long a, long p){
            long o = 1;
            while(p>0){
                if((p&1)==1)o = mul(o,a);
                a = mul(a,a);
                p>>=1;
            }
            return o;
        }
        final Comparator<Tuple> com = new Comparator<Tuple>() {
            @Override
            public int compare(Tuple t1, Tuple t2) {
                if(t1.x != t2.x)
                    return Long.compare(t1.x, t2.x);
                else
                    return Long.compare(t1.y, t2.y);
            }
        };
        class Tuple{
            int x, y, z;
            Tuple(int x, int y){
                this.x = x;
                this.y = y;
            }
        }
        int ni() {
            return in.nextInt();
        }
        long nl() {
            return in.nextLong();
        }
        void pn(Object o) {
            out.println(o);
        }
        void p(Object o) {
            out.print(o);
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new UnknownError();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new UnknownError();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
            return Long.parseLong(next());
        }

        public String next() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuffer res = new StringBuffer();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));

            return res.toString();
        }

        private boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

    }
} Main public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Hola solver = new Hola();
        solver.solve(1, in, out);
        out.close();
    } main {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Hola solver = new Hola();
        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 InputReader in = new InputReader(inputStream); in new InputReader(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) Hola solver = new Hola(); solver new Hola() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class Hola {
        PrintWriter out;
        InputReader in;
        long mod = (long)1e9 + 7;
        int MAXN = (int)2e5 + 5;
        int[] segtree;
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            this.out = out;
            this.in = in;
            int n = ni();
            int k = ni();
            int[] cnt = new int[n + 1];
            int i = 0;
            for(i = 0; i < k; i++) {
                int x = ni();
                for(int j = 0; j < x; j++)
                    cnt[ni()]++;
            }
            int c = 0;
            for(i = 1; i <= n; i++){
                if(cnt[i] == 0)
                    c++;
            }
            pn(c);
        }


        void sort(int[] A){
            PriorityQueue<Integer> pq = new PriorityQueue();
            int i = 0;
            for(i = 0; i < A.length; i++)
                pq.add(A[i]);
            for(i = 0; i < A.length; i++)
                A[i] = pq.poll();
        }
        int gcd(int a, int b)
        {
            if (a == 0)
                return b;

            return gcd(b%a, a);
        }
        long mul(long a,long b){
            if(a>=mod)a%=mod;
            if(b>=mod)b%=mod;
            a*=b;
            if(a>=mod)a%=mod;
            return a;
        }
        long modPow(long a, long p){
            long o = 1;
            while(p>0){
                if((p&1)==1)o = mul(o,a);
                a = mul(a,a);
                p>>=1;
            }
            return o;
        }
        final Comparator<Tuple> com = new Comparator<Tuple>() {
            @Override
            public int compare(Tuple t1, Tuple t2) {
                if(t1.x != t2.x)
                    return Long.compare(t1.x, t2.x);
                else
                    return Long.compare(t1.y, t2.y);
            }
        };
        class Tuple{
            int x, y, z;
            Tuple(int x, int y){
                this.x = x;
                this.y = y;
            }
        }
        int ni() {
            return in.nextInt();
        }
        long nl() {
            return in.nextLong();
        }
        void pn(Object o) {
            out.println(o);
        }
        void p(Object o) {
            out.print(o);
        }

    } Hola PrintWriter out; out InputReader in; in long mod = (long)1e9 + 7; mod (long)1e9 + 7 (long)1e9 7 int MAXN = (int)2e5 + 5; MAXN (int)2e5 + 5 (int)2e5 5 int[] segtree; segtree final Comparator<Tuple> com = new Comparator<Tuple>() {
            @Override
            public int compare(Tuple t1, Tuple t2) {
                if(t1.x != t2.x)
                    return Long.compare(t1.x, t2.x);
                else
                    return Long.compare(t1.y, t2.y);
            }
        }; com new Comparator<Tuple>() {
            @Override
            public int compare(Tuple t1, Tuple t2) {
                if(t1.x != t2.x)
                    return Long.compare(t1.x, t2.x);
                else
                    return Long.compare(t1.y, t2.y);
            }
        } public void solve(int testNumber, InputReader in, PrintWriter out) {
            this.out = out;
            this.in = in;
            int n = ni();
            int k = ni();
            int[] cnt = new int[n + 1];
            int i = 0;
            for(i = 0; i < k; i++) {
                int x = ni();
                for(int j = 0; j < x; j++)
                    cnt[ni()]++;
            }
            int c = 0;
            for(i = 1; i <= n; i++){
                if(cnt[i] == 0)
                    c++;
            }
            pn(c);
        } solve {
            this.out = out;
            this.in = in;
            int n = ni();
            int k = ni();
            int[] cnt = new int[n + 1];
            int i = 0;
            for(i = 0; i < k; i++) {
                int x = ni();
                for(int j = 0; j < x; j++)
                    cnt[ni()]++;
            }
            int c = 0;
            for(i = 1; i <= n; i++){
                if(cnt[i] == 0)
                    c++;
            }
            pn(c);
        } this.out = out this.out this this.out out this.in = in this.in this this.in in int n = ni(); n ni() ni int k = ni(); k ni() ni int[] cnt = new int[n + 1]; cnt new int[n + 1] n + 1 n 1 int i = 0; i 0 for(i = 0; i < k; i++) {
                int x = ni();
                for(int j = 0; j < x; j++)
                    cnt[ni()]++;
            } i = 0; i = 0 i 0 i < k i k i++ i++ i {
                int x = ni();
                for(int j = 0; j < x; j++)
                    cnt[ni()]++;
            } {
                int x = ni();
                for(int j = 0; j < x; j++)
                    cnt[ni()]++;
            } int x = ni(); x ni() ni for(int j = 0; j < x; j++)
                    cnt[ni()]++; int j = 0; int j = 0; j 0 j < x j x j++ j++ j cnt[ni()]++; cnt[ni()]++ cnt[ni()] cnt ni() ni int c = 0; c 0 for(i = 1; i <= n; i++){
                if(cnt[i] == 0)
                    c++;
            } i = 1; i = 1 i 1 i <= n i n i++ i++ i {
                if(cnt[i] == 0)
                    c++;
            } {
                if(cnt[i] == 0)
                    c++;
            } if(cnt[i] == 0)
                    c++; cnt[i] == 0 cnt[i] cnt i 0 c++ c pn(c) pn c int testNumber testNumber InputReader in in PrintWriter out out void sort(int[] A){
            PriorityQueue<Integer> pq = new PriorityQueue();
            int i = 0;
            for(i = 0; i < A.length; i++)
                pq.add(A[i]);
            for(i = 0; i < A.length; i++)
                A[i] = pq.poll();
        } sort {
            PriorityQueue<Integer> pq = new PriorityQueue();
            int i = 0;
            for(i = 0; i < A.length; i++)
                pq.add(A[i]);
            for(i = 0; i < A.length; i++)
                A[i] = pq.poll();
        } PriorityQueue<Integer> pq = new PriorityQueue(); pq new PriorityQueue() int i = 0; i 0 for(i = 0; i < A.length; i++)
                pq.add(A[i]); i = 0; i = 0 i 0 i < A.length i A.length A A.length i++ i++ i pq.add(A[i]); pq.add(A[i]) pq.add pq A[i] A i for(i = 0; i < A.length; i++)
                A[i] = pq.poll(); i = 0; i = 0 i 0 i < A.length i A.length A A.length i++ i++ i A[i] = pq.poll(); A[i] = pq.poll() A[i] A i pq.poll() pq.poll pq int[] A A int gcd(int a, int b)
        {
            if (a == 0)
                return b;

            return gcd(b%a, a);
        } gcd {
            if (a == 0)
                return b;

            return gcd(b%a, a);
        } if (a == 0)
                return b; a == 0 a 0 return b; b return gcd(b%a, a); gcd(b%a, a) gcd b%a b a a int a a int b b long mul(long a,long b){
            if(a>=mod)a%=mod;
            if(b>=mod)b%=mod;
            a*=b;
            if(a>=mod)a%=mod;
            return a;
        } mul {
            if(a>=mod)a%=mod;
            if(b>=mod)b%=mod;
            a*=b;
            if(a>=mod)a%=mod;
            return a;
        } if(a>=mod)a%=mod; a>=mod a mod a%=mod a mod if(b>=mod)b%=mod; b>=mod b mod b%=mod b mod a*=b a b if(a>=mod)a%=mod; a>=mod a mod a%=mod a mod return a; a long a a long b b long modPow(long a, long p){
            long o = 1;
            while(p>0){
                if((p&1)==1)o = mul(o,a);
                a = mul(a,a);
                p>>=1;
            }
            return o;
        } modPow {
            long o = 1;
            while(p>0){
                if((p&1)==1)o = mul(o,a);
                a = mul(a,a);
                p>>=1;
            }
            return o;
        } long o = 1; o 1 while(p>0){
                if((p&1)==1)o = mul(o,a);
                a = mul(a,a);
                p>>=1;
            } p>0 p 0 {
                if((p&1)==1)o = mul(o,a);
                a = mul(a,a);
                p>>=1;
            } if((p&1)==1)o = mul(o,a); (p&1)==1 (p&1) p 1 1 o = mul(o,a) o mul(o,a) mul o a a = mul(a,a) a mul(a,a) mul a a p>>=1 p 1 return o; o long a a long p p int ni() {
            return in.nextInt();
        } ni {
            return in.nextInt();
        } return in.nextInt(); in.nextInt() in.nextInt in long nl() {
            return in.nextLong();
        } nl {
            return in.nextLong();
        } return in.nextLong(); in.nextLong() in.nextLong in void pn(Object o) {
            out.println(o);
        } pn {
            out.println(o);
        } out.println(o) out.println out o Object o o void p(Object o) {
            out.print(o);
        } p {
            out.print(o);
        } out.print(o) out.print out o Object o o class Tuple{
            int x, y, z;
            Tuple(int x, int y){
                this.x = x;
                this.y = y;
            }
        } Tuple int x x y y z; z Tuple(int x, int y){
                this.x = x;
                this.y = y;
            } Tuple {
                this.x = x;
                this.y = y;
            } this.x = x this.x this this.x x this.y = y this.y this this.y y int x x int y y static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new UnknownError();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new UnknownError();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
            return Long.parseLong(next());
        }

        public String next() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuffer res = new StringBuffer();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));

            return res.toString();
        }

        private boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

    } InputReader private InputStream stream; stream private byte[] buf = new byte[1024]; buf new byte[1024] 1024 private int curChar; curChar private int numChars; numChars public InputReader(InputStream stream) {
            this.stream = stream;
        } InputReader {
            this.stream = stream;
        } this.stream = stream this.stream this this.stream stream InputStream stream stream public int read() {
            if (numChars == -1)
                throw new UnknownError();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new UnknownError();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        } read {
            if (numChars == -1)
                throw new UnknownError();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new UnknownError();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        } if (numChars == -1)
                throw new UnknownError(); numChars == -1 numChars -1 1 throw new UnknownError(); new UnknownError() if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new UnknownError();
                }
                if (numChars <= 0)
                    return -1;
            } curChar >= numChars curChar numChars {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new UnknownError();
                }
                if (numChars <= 0)
                    return -1;
            } curChar = 0 curChar 0 try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new UnknownError();
                } catch (IOException e) {
                    throw new UnknownError();
                } IOException e {
                    throw new UnknownError();
                } throw new UnknownError(); new UnknownError() {
                    numChars = stream.read(buf);
                } numChars = stream.read(buf) numChars stream.read(buf) stream.read stream buf if (numChars <= 0)
                    return -1; numChars <= 0 numChars 0 return -1; -1 1 return buf[curChar++]; buf[curChar++] buf curChar++ curChar public int nextInt() {
            return Integer.parseInt(next());
        } nextInt {
            return Integer.parseInt(next());
        } return Integer.parseInt(next()); Integer.parseInt(next()) Integer.parseInt Integer next() next public long nextLong() {
            return Long.parseLong(next());
        } nextLong {
            return Long.parseLong(next());
        } return Long.parseLong(next()); Long.parseLong(next()) Long.parseLong Long next() next public String next() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuffer res = new StringBuffer();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));

            return res.toString();
        } next {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuffer res = new StringBuffer();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));

            return res.toString();
        } int c = read(); c read() read while (isSpaceChar(c))
                c = read(); isSpaceChar(c) isSpaceChar c c = read() c read() read StringBuffer res = new StringBuffer(); res new StringBuffer() do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c)); !isSpaceChar(c) isSpaceChar(c) isSpaceChar c {
                res.appendCodePoint(c);
                c = read();
            } res.appendCodePoint(c) res.appendCodePoint res c c = read() c read() read return res.toString(); res.toString() res.toString res private boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        } isSpaceChar {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        } return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1 c == '\t' c == '\r' c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1 c == ' ' c ' ' c == '\n' c '\n' c == '\r' c '\r' c == '\t' c '\t' c == -1 c -1 1 int c c public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Hola solver = new Hola();
        solver.solve(1, in, out);
        out.close();
    }

    static class Hola {
        PrintWriter out;
        InputReader in;
        long mod = (long)1e9 + 7;
        int MAXN = (int)2e5 + 5;
        int[] segtree;
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            this.out = out;
            this.in = in;
            int n = ni();
            int k = ni();
            int[] cnt = new int[n + 1];
            int i = 0;
            for(i = 0; i < k; i++) {
                int x = ni();
                for(int j = 0; j < x; j++)
                    cnt[ni()]++;
            }
            int c = 0;
            for(i = 1; i <= n; i++){
                if(cnt[i] == 0)
                    c++;
            }
            pn(c);
        }


        void sort(int[] A){
            PriorityQueue<Integer> pq = new PriorityQueue();
            int i = 0;
            for(i = 0; i < A.length; i++)
                pq.add(A[i]);
            for(i = 0; i < A.length; i++)
                A[i] = pq.poll();
        }
        int gcd(int a, int b)
        {
            if (a == 0)
                return b;

            return gcd(b%a, a);
        }
        long mul(long a,long b){
            if(a>=mod)a%=mod;
            if(b>=mod)b%=mod;
            a*=b;
            if(a>=mod)a%=mod;
            return a;
        }
        long modPow(long a, long p){
            long o = 1;
            while(p>0){
                if((p&1)==1)o = mul(o,a);
                a = mul(a,a);
                p>>=1;
            }
            return o;
        }
        final Comparator<Tuple> com = new Comparator<Tuple>() {
            @Override
            public int compare(Tuple t1, Tuple t2) {
                if(t1.x != t2.x)
                    return Long.compare(t1.x, t2.x);
                else
                    return Long.compare(t1.y, t2.y);
            }
        };
        class Tuple{
            int x, y, z;
            Tuple(int x, int y){
                this.x = x;
                this.y = y;
            }
        }
        int ni() {
            return in.nextInt();
        }
        long nl() {
            return in.nextLong();
        }
        void pn(Object o) {
            out.println(o);
        }
        void p(Object o) {
            out.print(o);
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new UnknownError();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new UnknownError();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
            return Long.parseLong(next());
        }

        public String next() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuffer res = new StringBuffer();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));

            return res.toString();
        }

        private boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

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

    static class Hola {
        PrintWriter out;
        InputReader in;
        long mod = (long)1e9 + 7;
        int MAXN = (int)2e5 + 5;
        int[] segtree;
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            this.out = out;
            this.in = in;
            int n = ni();
            int k = ni();
            int[] cnt = new int[n + 1];
            int i = 0;
            for(i = 0; i < k; i++) {
                int x = ni();
                for(int j = 0; j < x; j++)
                    cnt[ni()]++;
            }
            int c = 0;
            for(i = 1; i <= n; i++){
                if(cnt[i] == 0)
                    c++;
            }
            pn(c);
        }


        void sort(int[] A){
            PriorityQueue<Integer> pq = new PriorityQueue();
            int i = 0;
            for(i = 0; i < A.length; i++)
                pq.add(A[i]);
            for(i = 0; i < A.length; i++)
                A[i] = pq.poll();
        }
        int gcd(int a, int b)
        {
            if (a == 0)
                return b;

            return gcd(b%a, a);
        }
        long mul(long a,long b){
            if(a>=mod)a%=mod;
            if(b>=mod)b%=mod;
            a*=b;
            if(a>=mod)a%=mod;
            return a;
        }
        long modPow(long a, long p){
            long o = 1;
            while(p>0){
                if((p&1)==1)o = mul(o,a);
                a = mul(a,a);
                p>>=1;
            }
            return o;
        }
        final Comparator<Tuple> com = new Comparator<Tuple>() {
            @Override
            public int compare(Tuple t1, Tuple t2) {
                if(t1.x != t2.x)
                    return Long.compare(t1.x, t2.x);
                else
                    return Long.compare(t1.y, t2.y);
            }
        };
        class Tuple{
            int x, y, z;
            Tuple(int x, int y){
                this.x = x;
                this.y = y;
            }
        }
        int ni() {
            return in.nextInt();
        }
        long nl() {
            return in.nextLong();
        }
        void pn(Object o) {
            out.println(o);
        }
        void p(Object o) {
            out.print(o);
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new UnknownError();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new UnknownError();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
            return Long.parseLong(next());
        }

        public String next() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuffer res = new StringBuffer();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));

            return res.toString();
        }

        private boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

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

import java.util.*;

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

    static class Hola {
        PrintWriter out;
        InputReader in;
        long mod = (long)1e9 + 7;
        int MAXN = (int)2e5 + 5;
        int[] segtree;
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            this.out = out;
            this.in = in;
            int n = ni();
            int k = ni();
            int[] cnt = new int[n + 1];
            int i = 0;
            for(i = 0; i < k; i++) {
                int x = ni();
                for(int j = 0; j < x; j++)
                    cnt[ni()]++;
            }
            int c = 0;
            for(i = 1; i <= n; i++){
                if(cnt[i] == 0)
                    c++;
            }
            pn(c);
        }


        void sort(int[] A){
            PriorityQueue<Integer> pq = new PriorityQueue();
            int i = 0;
            for(i = 0; i < A.length; i++)
                pq.add(A[i]);
            for(i = 0; i < A.length; i++)
                A[i] = pq.poll();
        }
        int gcd(int a, int b)
        {
            if (a == 0)
                return b;

            return gcd(b%a, a);
        }
        long mul(long a,long b){
            if(a>=mod)a%=mod;
            if(b>=mod)b%=mod;
            a*=b;
            if(a>=mod)a%=mod;
            return a;
        }
        long modPow(long a, long p){
            long o = 1;
            while(p>0){
                if((p&1)==1)o = mul(o,a);
                a = mul(a,a);
                p>>=1;
            }
            return o;
        }
        final Comparator<Tuple> com = new Comparator<Tuple>() {
            @Override
            public int compare(Tuple t1, Tuple t2) {
                if(t1.x != t2.x)
                    return Long.compare(t1.x, t2.x);
                else
                    return Long.compare(t1.y, t2.y);
            }
        };
        class Tuple{
            int x, y, z;
            Tuple(int x, int y){
                this.x = x;
                this.y = y;
            }
        }
        int ni() {
            return in.nextInt();
        }
        long nl() {
            return in.nextLong();
        }
        void pn(Object o) {
            out.println(o);
        }
        void p(Object o) {
            out.print(o);
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new UnknownError();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new UnknownError();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
            return Long.parseLong(next());
        }

        public String next() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuffer res = new StringBuffer();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));

            return res.toString();
        }

        private boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

    }
}