import java.util.*;

class Main {
    public static void main(String args[]) {
        Scanner inp = new Scanner(System.in);
        int n = inp.nextInt();
        int k = inp.nextInt();
        int ni = 0;
        Set<Integer> a = new TreeSet<Integer>();
        for (int i = 0; i < k; i++) {
            ni = inp.nextInt();
            for (int j = 0; j < ni; j++) {
                a.add(inp.nextInt());
            }
        }
        int tmp[] = new int[n];
        int ans = 0;
        for (int i = 1; i <= n; i++) {
            if (!(a.contains(i))) {
                ans++;
            }
        }
        System.out.println(ans);
    }
} import java.util.*; util.* java class Main {
    public static void main(String args[]) {
        Scanner inp = new Scanner(System.in);
        int n = inp.nextInt();
        int k = inp.nextInt();
        int ni = 0;
        Set<Integer> a = new TreeSet<Integer>();
        for (int i = 0; i < k; i++) {
            ni = inp.nextInt();
            for (int j = 0; j < ni; j++) {
                a.add(inp.nextInt());
            }
        }
        int tmp[] = new int[n];
        int ans = 0;
        for (int i = 1; i <= n; i++) {
            if (!(a.contains(i))) {
                ans++;
            }
        }
        System.out.println(ans);
    }
} Main public static void main(String args[]) {
        Scanner inp = new Scanner(System.in);
        int n = inp.nextInt();
        int k = inp.nextInt();
        int ni = 0;
        Set<Integer> a = new TreeSet<Integer>();
        for (int i = 0; i < k; i++) {
            ni = inp.nextInt();
            for (int j = 0; j < ni; j++) {
                a.add(inp.nextInt());
            }
        }
        int tmp[] = new int[n];
        int ans = 0;
        for (int i = 1; i <= n; i++) {
            if (!(a.contains(i))) {
                ans++;
            }
        }
        System.out.println(ans);
    } main {
        Scanner inp = new Scanner(System.in);
        int n = inp.nextInt();
        int k = inp.nextInt();
        int ni = 0;
        Set<Integer> a = new TreeSet<Integer>();
        for (int i = 0; i < k; i++) {
            ni = inp.nextInt();
            for (int j = 0; j < ni; j++) {
                a.add(inp.nextInt());
            }
        }
        int tmp[] = new int[n];
        int ans = 0;
        for (int i = 1; i <= n; i++) {
            if (!(a.contains(i))) {
                ans++;
            }
        }
        System.out.println(ans);
    } Scanner inp = new Scanner(System.in); inp new Scanner(System.in) int n = inp.nextInt(); n inp.nextInt() inp.nextInt inp int k = inp.nextInt(); k inp.nextInt() inp.nextInt inp int ni = 0; ni 0 Set<Integer> a = new TreeSet<Integer>(); a new TreeSet<Integer>() for (int i = 0; i < k; i++) {
            ni = inp.nextInt();
            for (int j = 0; j < ni; j++) {
                a.add(inp.nextInt());
            }
        } int i = 0; int i = 0; i 0 i < k i k i++ i++ i {
            ni = inp.nextInt();
            for (int j = 0; j < ni; j++) {
                a.add(inp.nextInt());
            }
        } {
            ni = inp.nextInt();
            for (int j = 0; j < ni; j++) {
                a.add(inp.nextInt());
            }
        } ni = inp.nextInt() ni inp.nextInt() inp.nextInt inp for (int j = 0; j < ni; j++) {
                a.add(inp.nextInt());
            } int j = 0; int j = 0; j 0 j < ni j ni j++ j++ j {
                a.add(inp.nextInt());
            } {
                a.add(inp.nextInt());
            } a.add(inp.nextInt()) a.add a inp.nextInt() inp.nextInt inp int tmp[] = new int[n]; tmp new int[n] n int ans = 0; ans 0 for (int i = 1; i <= n; i++) {
            if (!(a.contains(i))) {
                ans++;
            }
        } int i = 1; int i = 1; i 1 i <= n i n i++ i++ i {
            if (!(a.contains(i))) {
                ans++;
            }
        } {
            if (!(a.contains(i))) {
                ans++;
            }
        } if (!(a.contains(i))) {
                ans++;
            } !(a.contains(i)) (a.contains(i)) a.contains a i {
                ans++;
            } ans++ ans System.out.println(ans) System.out.println System.out System System.out ans String args[] args
import java.util.*;

class Main {
    public static void main(String args[]) {
        Scanner inp = new Scanner(System.in);
        int n = inp.nextInt();
        int k = inp.nextInt();
        int ni = 0;
        Set<Integer> a = new TreeSet<Integer>();
        for (int i = 0; i < k; i++) {
            ni = inp.nextInt();
            for (int j = 0; j < ni; j++) {
                a.add(inp.nextInt());
            }
        }
        int tmp[] = new int[n];
        int ans = 0;
        for (int i = 1; i <= n; i++) {
            if (!(a.contains(i))) {
                ans++;
            }
        }
        System.out.println(ans);
    }
}