import java.util.*;
import java.math.*;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int k = sc.nextInt();

    int[][] data =  new int[n+1][k+1];

    for (int i = 1; i < k+1; i++) {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) {
        data[sc.nextInt()][i]++;
      }
    }

    int count = 0;
    int ans = 0;

    for (int i = 1; i < n+1; i++) {
      for (int j = 1; j < k+1; j++) {
        if (data[i][j] != 0) {
          count++;
        }
      }
      if (count == 0) {
        ans++;
      }
      count = 0;
    }

    System.out.println(ans);




  }

} import java.util.*; util.* java import java.math.*; math.* java public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int k = sc.nextInt();

    int[][] data =  new int[n+1][k+1];

    for (int i = 1; i < k+1; i++) {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) {
        data[sc.nextInt()][i]++;
      }
    }

    int count = 0;
    int ans = 0;

    for (int i = 1; i < n+1; i++) {
      for (int j = 1; j < k+1; j++) {
        if (data[i][j] != 0) {
          count++;
        }
      }
      if (count == 0) {
        ans++;
      }
      count = 0;
    }

    System.out.println(ans);




  }

} Main public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int k = sc.nextInt();

    int[][] data =  new int[n+1][k+1];

    for (int i = 1; i < k+1; i++) {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) {
        data[sc.nextInt()][i]++;
      }
    }

    int count = 0;
    int ans = 0;

    for (int i = 1; i < n+1; i++) {
      for (int j = 1; j < k+1; j++) {
        if (data[i][j] != 0) {
          count++;
        }
      }
      if (count == 0) {
        ans++;
      }
      count = 0;
    }

    System.out.println(ans);




  } main {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int k = sc.nextInt();

    int[][] data =  new int[n+1][k+1];

    for (int i = 1; i < k+1; i++) {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) {
        data[sc.nextInt()][i]++;
      }
    }

    int count = 0;
    int ans = 0;

    for (int i = 1; i < n+1; i++) {
      for (int j = 1; j < k+1; j++) {
        if (data[i][j] != 0) {
          count++;
        }
      }
      if (count == 0) {
        ans++;
      }
      count = 0;
    }

    System.out.println(ans);




  } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int k = sc.nextInt(); k sc.nextInt() sc.nextInt sc int[][] data =  new int[n+1][k+1]; data new int[n+1][k+1] n+1 n 1 k+1 k 1 for (int i = 1; i < k+1; i++) {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) {
        data[sc.nextInt()][i]++;
      }
    } int i = 1; int i = 1; i 1 i < k+1 i k+1 k 1 i++ i++ i {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) {
        data[sc.nextInt()][i]++;
      }
    } {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) {
        data[sc.nextInt()][i]++;
      }
    } int d = sc.nextInt(); d sc.nextInt() sc.nextInt sc for (int j = 0; j < d; j++) {
        data[sc.nextInt()][i]++;
      } int j = 0; int j = 0; j 0 j < d j d j++ j++ j {
        data[sc.nextInt()][i]++;
      } {
        data[sc.nextInt()][i]++;
      } data[sc.nextInt()][i]++ data[sc.nextInt()][i] data[sc.nextInt()] data sc.nextInt() sc.nextInt sc i int count = 0; count 0 int ans = 0; ans 0 for (int i = 1; i < n+1; i++) {
      for (int j = 1; j < k+1; j++) {
        if (data[i][j] != 0) {
          count++;
        }
      }
      if (count == 0) {
        ans++;
      }
      count = 0;
    } int i = 1; int i = 1; i 1 i < n+1 i n+1 n 1 i++ i++ i {
      for (int j = 1; j < k+1; j++) {
        if (data[i][j] != 0) {
          count++;
        }
      }
      if (count == 0) {
        ans++;
      }
      count = 0;
    } {
      for (int j = 1; j < k+1; j++) {
        if (data[i][j] != 0) {
          count++;
        }
      }
      if (count == 0) {
        ans++;
      }
      count = 0;
    } for (int j = 1; j < k+1; j++) {
        if (data[i][j] != 0) {
          count++;
        }
      } int j = 1; int j = 1; j 1 j < k+1 j k+1 k 1 j++ j++ j {
        if (data[i][j] != 0) {
          count++;
        }
      } {
        if (data[i][j] != 0) {
          count++;
        }
      } if (data[i][j] != 0) {
          count++;
        } data[i][j] != 0 data[i][j] data[i] data i j 0 {
          count++;
        } count++ count if (count == 0) {
        ans++;
      } count == 0 count 0 {
        ans++;
      } ans++ ans count = 0 count 0 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) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int k = sc.nextInt();

    int[][] data =  new int[n+1][k+1];

    for (int i = 1; i < k+1; i++) {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) {
        data[sc.nextInt()][i]++;
      }
    }

    int count = 0;
    int ans = 0;

    for (int i = 1; i < n+1; i++) {
      for (int j = 1; j < k+1; j++) {
        if (data[i][j] != 0) {
          count++;
        }
      }
      if (count == 0) {
        ans++;
      }
      count = 0;
    }

    System.out.println(ans);




  }

} public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int k = sc.nextInt();

    int[][] data =  new int[n+1][k+1];

    for (int i = 1; i < k+1; i++) {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) {
        data[sc.nextInt()][i]++;
      }
    }

    int count = 0;
    int ans = 0;

    for (int i = 1; i < n+1; i++) {
      for (int j = 1; j < k+1; j++) {
        if (data[i][j] != 0) {
          count++;
        }
      }
      if (count == 0) {
        ans++;
      }
      count = 0;
    }

    System.out.println(ans);




  }

} Main
import java.util.*;
import java.math.*;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int k = sc.nextInt();

    int[][] data =  new int[n+1][k+1];

    for (int i = 1; i < k+1; i++) {
      int d = sc.nextInt();
      for (int j = 0; j < d; j++) {
        data[sc.nextInt()][i]++;
      }
    }

    int count = 0;
    int ans = 0;

    for (int i = 1; i < n+1; i++) {
      for (int j = 1; j < k+1; j++) {
        if (data[i][j] != 0) {
          count++;
        }
      }
      if (count == 0) {
        ans++;
      }
      count = 0;
    }

    System.out.println(ans);




  }

}
