import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        // 人数
        int n;
        // お菓子の種類
        int k;
        
        Scanner sc = new Scanner(System.in);
        
        n = sc.nextInt();
        k = sc.nextInt();
        
        boolean[] has = new boolean[n + 1];
        
        for (int i = 0; i < k; i++) {
            int d = sc.nextInt();
            
            for (int j = 0; j < d; j++) {
                has[sc.nextInt()] = true;
            }
        }
        
        int ans = 0;
        for (int i = 1; i < has.length; i++) {
            if (!has[i]) {
                ans++;
            }
        }
        
        System.out.println(ans);
    }
} import java.util.Scanner; Scanner java.util public class Main {
    public static void main(String[] args) {
        // 人数
        int n;
        // お菓子の種類
        int k;
        
        Scanner sc = new Scanner(System.in);
        
        n = sc.nextInt();
        k = sc.nextInt();
        
        boolean[] has = new boolean[n + 1];
        
        for (int i = 0; i < k; i++) {
            int d = sc.nextInt();
            
            for (int j = 0; j < d; j++) {
                has[sc.nextInt()] = true;
            }
        }
        
        int ans = 0;
        for (int i = 1; i < has.length; i++) {
            if (!has[i]) {
                ans++;
            }
        }
        
        System.out.println(ans);
    }
} Main public static void main(String[] args) {
        // 人数
        int n;
        // お菓子の種類
        int k;
        
        Scanner sc = new Scanner(System.in);
        
        n = sc.nextInt();
        k = sc.nextInt();
        
        boolean[] has = new boolean[n + 1];
        
        for (int i = 0; i < k; i++) {
            int d = sc.nextInt();
            
            for (int j = 0; j < d; j++) {
                has[sc.nextInt()] = true;
            }
        }
        
        int ans = 0;
        for (int i = 1; i < has.length; i++) {
            if (!has[i]) {
                ans++;
            }
        }
        
        System.out.println(ans);
    } main {
        // 人数
        int n;
        // お菓子の種類
        int k;
        
        Scanner sc = new Scanner(System.in);
        
        n = sc.nextInt();
        k = sc.nextInt();
        
        boolean[] has = new boolean[n + 1];
        
        for (int i = 0; i < k; i++) {
            int d = sc.nextInt();
            
            for (int j = 0; j < d; j++) {
                has[sc.nextInt()] = true;
            }
        }
        
        int ans = 0;
        for (int i = 1; i < has.length; i++) {
            if (!has[i]) {
                ans++;
            }
        }
        
        System.out.println(ans);
    } int n; n int k; k Scanner sc = new Scanner(System.in); sc new Scanner(System.in) n = sc.nextInt() n sc.nextInt() sc.nextInt sc k = sc.nextInt() k sc.nextInt() sc.nextInt sc boolean[] has = new boolean[n + 1]; has new boolean[n + 1] n + 1 n 1 for (int i = 0; i < k; i++) {
            int d = sc.nextInt();
            
            for (int j = 0; j < d; j++) {
                has[sc.nextInt()] = true;
            }
        } int i = 0; int i = 0; i 0 i < k i k i++ i++ i {
            int d = sc.nextInt();
            
            for (int j = 0; j < d; j++) {
                has[sc.nextInt()] = true;
            }
        } {
            int d = sc.nextInt();
            
            for (int j = 0; j < d; j++) {
                has[sc.nextInt()] = true;
            }
        } int d = sc.nextInt(); d sc.nextInt() sc.nextInt sc for (int j = 0; j < d; j++) {
                has[sc.nextInt()] = true;
            } int j = 0; int j = 0; j 0 j < d j d j++ j++ j {
                has[sc.nextInt()] = true;
            } {
                has[sc.nextInt()] = true;
            } has[sc.nextInt()] = true has[sc.nextInt()] has sc.nextInt() sc.nextInt sc true int ans = 0; ans 0 for (int i = 1; i < has.length; i++) {
            if (!has[i]) {
                ans++;
            }
        } int i = 1; int i = 1; i 1 i < has.length i has.length has has.length i++ i++ i {
            if (!has[i]) {
                ans++;
            }
        } {
            if (!has[i]) {
                ans++;
            }
        } if (!has[i]) {
                ans++;
            } !has[i] has[i] has i {
                ans++;
            } ans++ ans System.out.println(ans) System.out.println System.out System System.out ans String[] args args public class Main {
    public static void main(String[] args) {
        // 人数
        int n;
        // お菓子の種類
        int k;
        
        Scanner sc = new Scanner(System.in);
        
        n = sc.nextInt();
        k = sc.nextInt();
        
        boolean[] has = new boolean[n + 1];
        
        for (int i = 0; i < k; i++) {
            int d = sc.nextInt();
            
            for (int j = 0; j < d; j++) {
                has[sc.nextInt()] = true;
            }
        }
        
        int ans = 0;
        for (int i = 1; i < has.length; i++) {
            if (!has[i]) {
                ans++;
            }
        }
        
        System.out.println(ans);
    }
} public class Main {
    public static void main(String[] args) {
        // 人数
        int n;
        // お菓子の種類
        int k;
        
        Scanner sc = new Scanner(System.in);
        
        n = sc.nextInt();
        k = sc.nextInt();
        
        boolean[] has = new boolean[n + 1];
        
        for (int i = 0; i < k; i++) {
            int d = sc.nextInt();
            
            for (int j = 0; j < d; j++) {
                has[sc.nextInt()] = true;
            }
        }
        
        int ans = 0;
        for (int i = 1; i < has.length; i++) {
            if (!has[i]) {
                ans++;
            }
        }
        
        System.out.println(ans);
    }
} Main
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        // 人数
        int n;
        // お菓子の種類
        int k;
        
        Scanner sc = new Scanner(System.in);
        
        n = sc.nextInt();
        k = sc.nextInt();
        
        boolean[] has = new boolean[n + 1];
        
        for (int i = 0; i < k; i++) {
            int d = sc.nextInt();
            
            for (int j = 0; j < d; j++) {
                has[sc.nextInt()] = true;
            }
        }
        
        int ans = 0;
        for (int i = 1; i < has.length; i++) {
            if (!has[i]) {
                ans++;
            }
        }
        
        System.out.println(ans);
    }
}