import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
  public static void main(String[] args) {
    InputStream inputStream = System.in;
    OutputStream outputStream = System.out;
    Scanner in = new Scanner(inputStream);
    PrintWriter out = new PrintWriter(outputStream);
    B solver = new B();
    solver.solve(1, in, out);
    out.close();
  }

  static class B {
    public void solve(int testNumber, Scanner in, PrintWriter out) {
      int N = in.nextInt();
      int K = in.nextInt();
      int[] res = new int[N];

      Arrays.fill(res, 0);

      for (int i = 0; i < K; i++) {
        int di = in.nextInt();

        for (int j = 0; j < di; j++) {
          int A = in.nextInt();
          res[A - 1] += 1;
        }
      }

      int count = 0;
      for (int r : res) {
        if (r == 0) count += 1;
      }

      out.print(count);
    }

  }
}
 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.Arrays; Arrays java.util import java.util.Scanner; Scanner java.util public class Main {
  public static void main(String[] args) {
    InputStream inputStream = System.in;
    OutputStream outputStream = System.out;
    Scanner in = new Scanner(inputStream);
    PrintWriter out = new PrintWriter(outputStream);
    B solver = new B();
    solver.solve(1, in, out);
    out.close();
  }

  static class B {
    public void solve(int testNumber, Scanner in, PrintWriter out) {
      int N = in.nextInt();
      int K = in.nextInt();
      int[] res = new int[N];

      Arrays.fill(res, 0);

      for (int i = 0; i < K; i++) {
        int di = in.nextInt();

        for (int j = 0; j < di; j++) {
          int A = in.nextInt();
          res[A - 1] += 1;
        }
      }

      int count = 0;
      for (int r : res) {
        if (r == 0) count += 1;
      }

      out.print(count);
    }

  }
} Main public static void main(String[] args) {
    InputStream inputStream = System.in;
    OutputStream outputStream = System.out;
    Scanner in = new Scanner(inputStream);
    PrintWriter out = new PrintWriter(outputStream);
    B solver = new B();
    solver.solve(1, in, out);
    out.close();
  } main {
    InputStream inputStream = System.in;
    OutputStream outputStream = System.out;
    Scanner in = new Scanner(inputStream);
    PrintWriter out = new PrintWriter(outputStream);
    B solver = new B();
    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 Scanner in = new Scanner(inputStream); in new Scanner(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) B solver = new B(); solver new B() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class B {
    public void solve(int testNumber, Scanner in, PrintWriter out) {
      int N = in.nextInt();
      int K = in.nextInt();
      int[] res = new int[N];

      Arrays.fill(res, 0);

      for (int i = 0; i < K; i++) {
        int di = in.nextInt();

        for (int j = 0; j < di; j++) {
          int A = in.nextInt();
          res[A - 1] += 1;
        }
      }

      int count = 0;
      for (int r : res) {
        if (r == 0) count += 1;
      }

      out.print(count);
    }

  } B public void solve(int testNumber, Scanner in, PrintWriter out) {
      int N = in.nextInt();
      int K = in.nextInt();
      int[] res = new int[N];

      Arrays.fill(res, 0);

      for (int i = 0; i < K; i++) {
        int di = in.nextInt();

        for (int j = 0; j < di; j++) {
          int A = in.nextInt();
          res[A - 1] += 1;
        }
      }

      int count = 0;
      for (int r : res) {
        if (r == 0) count += 1;
      }

      out.print(count);
    } solve {
      int N = in.nextInt();
      int K = in.nextInt();
      int[] res = new int[N];

      Arrays.fill(res, 0);

      for (int i = 0; i < K; i++) {
        int di = in.nextInt();

        for (int j = 0; j < di; j++) {
          int A = in.nextInt();
          res[A - 1] += 1;
        }
      }

      int count = 0;
      for (int r : res) {
        if (r == 0) count += 1;
      }

      out.print(count);
    } int N = in.nextInt(); N in.nextInt() in.nextInt in int K = in.nextInt(); K in.nextInt() in.nextInt in int[] res = new int[N]; res new int[N] N Arrays.fill(res, 0) Arrays.fill Arrays res 0 for (int i = 0; i < K; i++) {
        int di = in.nextInt();

        for (int j = 0; j < di; j++) {
          int A = in.nextInt();
          res[A - 1] += 1;
        }
      } int i = 0; int i = 0; i 0 i < K i K i++ i++ i {
        int di = in.nextInt();

        for (int j = 0; j < di; j++) {
          int A = in.nextInt();
          res[A - 1] += 1;
        }
      } {
        int di = in.nextInt();

        for (int j = 0; j < di; j++) {
          int A = in.nextInt();
          res[A - 1] += 1;
        }
      } int di = in.nextInt(); di in.nextInt() in.nextInt in for (int j = 0; j < di; j++) {
          int A = in.nextInt();
          res[A - 1] += 1;
        } int j = 0; int j = 0; j 0 j < di j di j++ j++ j {
          int A = in.nextInt();
          res[A - 1] += 1;
        } {
          int A = in.nextInt();
          res[A - 1] += 1;
        } int A = in.nextInt(); A in.nextInt() in.nextInt in res[A - 1] += 1 res[A - 1] res A - 1 A 1 1 int count = 0; count 0 for (int r : res) {
        if (r == 0) count += 1;
      } int r res {
        if (r == 0) count += 1;
      } {
        if (r == 0) count += 1;
      } if (r == 0) count += 1; r == 0 r 0 count += 1 count 1 out.print(count) out.print out count int testNumber testNumber Scanner in in PrintWriter out out public class Main {
  public static void main(String[] args) {
    InputStream inputStream = System.in;
    OutputStream outputStream = System.out;
    Scanner in = new Scanner(inputStream);
    PrintWriter out = new PrintWriter(outputStream);
    B solver = new B();
    solver.solve(1, in, out);
    out.close();
  }

  static class B {
    public void solve(int testNumber, Scanner in, PrintWriter out) {
      int N = in.nextInt();
      int K = in.nextInt();
      int[] res = new int[N];

      Arrays.fill(res, 0);

      for (int i = 0; i < K; i++) {
        int di = in.nextInt();

        for (int j = 0; j < di; j++) {
          int A = in.nextInt();
          res[A - 1] += 1;
        }
      }

      int count = 0;
      for (int r : res) {
        if (r == 0) count += 1;
      }

      out.print(count);
    }

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

  static class B {
    public void solve(int testNumber, Scanner in, PrintWriter out) {
      int N = in.nextInt();
      int K = in.nextInt();
      int[] res = new int[N];

      Arrays.fill(res, 0);

      for (int i = 0; i < K; i++) {
        int di = in.nextInt();

        for (int j = 0; j < di; j++) {
          int A = in.nextInt();
          res[A - 1] += 1;
        }
      }

      int count = 0;
      for (int r : res) {
        if (r == 0) count += 1;
      }

      out.print(count);
    }

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

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
  public static void main(String[] args) {
    InputStream inputStream = System.in;
    OutputStream outputStream = System.out;
    Scanner in = new Scanner(inputStream);
    PrintWriter out = new PrintWriter(outputStream);
    B solver = new B();
    solver.solve(1, in, out);
    out.close();
  }

  static class B {
    public void solve(int testNumber, Scanner in, PrintWriter out) {
      int N = in.nextInt();
      int K = in.nextInt();
      int[] res = new int[N];

      Arrays.fill(res, 0);

      for (int i = 0; i < K; i++) {
        int di = in.nextInt();

        for (int j = 0; j < di; j++) {
          int A = in.nextInt();
          res[A - 1] += 1;
        }
      }

      int count = 0;
      for (int r : res) {
        if (r == 0) count += 1;
      }

      out.print(count);
    }

  }
}

