description: When you play the game of thrones, you win, or you die. There is no middle ground.
  
  Cersei Lannister, A Game of Thrones by George R. R. Martin
  
  There are n nobles, numbered from 1 to n. Noble i has a power of i. There are also m "friendships". A friendship between nobles a and b is always mutual.
  
  A noble is defined to be vulnerable if both of the following conditions are satisfied: 
  
    * the noble has at least one friend, and 
    * all of that noble's friends have a higher power. 
  
  
  
  You will have to process the following three types of queries. 
  
    1. Add a friendship between nobles u and v. 
    2. Remove a friendship between nobles u and v. 
    3. Calculate the answer to the following process. 
  
  
  
  The process: all vulnerable nobles are simultaneously killed, and all their friendships end. Then, it is possible that new nobles become vulnerable. The process repeats itself until no nobles are vulnerable. It can be proven that the process will end in finite time. After the process is complete, you need to calculate the number of remaining nobles.
  
  Note that the results of the process are not carried over between queries, that is, every process starts with all nobles being alive!
  
  Input
  
  The first line contains the integers n and m (1 ≤ n ≤ 2⋅ 10^5, 0 ≤ m ≤ 2⋅ 10^5) — the number of nobles and number of original friendships respectively.
  
  The next m lines each contain the integers u and v (1 ≤ u,v ≤ n, u ≠ v), describing a friendship. No friendship is listed twice.
  
  The next line contains the integer q (1 ≤ q ≤ 2⋅ {10}^{5}) — the number of queries. 
  
  The next q lines contain the queries themselves, each query has one of the following three formats. 
  
    * 1 u v (1 ≤ u,v ≤ n, u ≠ v) — add a friendship between u and v. It is guaranteed that u and v are not friends at this moment. 
    * 2 u v (1 ≤ u,v ≤ n, u ≠ v) — remove a friendship between u and v. It is guaranteed that u and v are friends at this moment. 
    * 3 — print the answer to the process described in the statement. 
  
  Output
  
  For each type 3 query print one integer to a new line. It is guaranteed that there will be at least one type 3 query.
  
  Examples
  
  Input
  
  
  4 3
  2 1
  1 3
  3 4
  4
  3
  1 2 3
  2 3 1
  3
  
  
  Output
  
  
  2
  1
  
  
  Input
  
  
  4 3
  2 3
  3 4
  4 1
  1
  3
  
  
  Output
  
  
  1
  
  Note
  
  Consider the first example. In the first type 3 query, we have the diagram below.
  
  In the first round of the process, noble 1 is weaker than all of his friends (2 and 3), and is thus killed. No other noble is vulnerable in round 1. In round 2, noble 3 is weaker than his only friend, noble 4, and is therefore killed. At this point, the process ends, and the answer is 2.
  
  <image>
  
  In the second type 3 query, the only surviving noble is 4.
  
  The second example consists of only one type 3 query. In the first round, two nobles are killed, and in the second round, one noble is killed. The final answer is 1, since only one noble survives.
  
  <image>
solution: import java.io.*;
  import java.util.HashSet;
  import java.util.Set;
  import java.util.StringTokenizer;
  
  public final class Main {
      public static void main(final String... args) throws IOException {
          final BufferedReader reader = Helper.newBufferedReader(16384);
          final BufferedWriter writer = Helper.newBufferedWriter(8192);
  
          final int n, m;
          {
              final StringTokenizer tokenizer = Helper.spaceSplitter(reader.readLine());
              n = Integer.parseInt(tokenizer.nextToken());
              m = Integer.parseInt(tokenizer.nextToken());
          }
          Nobleman.i(n);
          for (int i = 0; i < m; i++) {
              final StringTokenizer tokenizer = Helper.spaceSplitter(reader.readLine());
              friends(tokenizer);
          }
          final int q = Integer.parseInt(reader.readLine());
          for (int i = 0; i < q; i++) {
              final StringTokenizer tokenizer = Helper.spaceSplitter(reader.readLine());
              switch (tokenizer.nextToken()) {
                  case "1": {
                      friends(tokenizer);
  
                      break;
                  }
                  case "2": {
                      Nobleman.notLongerFriends(
                              Nobleman.get(Integer.parseInt(tokenizer.nextToken()) - 1),
                              Nobleman.get(Integer.parseInt(tokenizer.nextToken()) - 1)
                      );
  
                      break;
                  }
                  case "3": {
                      writer.write(String.valueOf(n - Nobleman.getDeadCount()));
                      writer.newLine();
  
                      break;
                  }
              }
          }
  
          writer.close();
      }
  
      private static void friends(final StringTokenizer tokenizer) {
          Nobleman.friends(
                  Nobleman.get(Integer.parseInt(tokenizer.nextToken()) - 1),
                  Nobleman.get(Integer.parseInt(tokenizer.nextToken()) - 1)
          );
      }
  }
  
  final class Nobleman {
      private static Nobleman[] noblemen;
      private static int deadCount;
  
      private final int power;
      private final Set<Nobleman> deadReason;
  
      public Nobleman(final int power) {
          this.power = power;
          this.deadReason = new HashSet<>();
      }
  
      public static int getDeadCount() {
          return deadCount;
      }
  
      public static void notLongerFriends(final Nobleman first, final Nobleman second) {
          if (first == second)
              throw new IllegalArgumentException();
  
          final boolean fDRNE = !first.deadReason.isEmpty();
          final boolean sDRNE = !second.deadReason.isEmpty();
          first.deadReason.remove(second);
          second.deadReason.remove(first);
          if ((first.deadReason.isEmpty() && fDRNE) || (second.deadReason.isEmpty() && sDRNE))
              deadCount--;
      }
  
      public static void friends(final Nobleman first, final Nobleman second) {
          if (first == second)
              throw new IllegalArgumentException();
  
          if (first.power > second.power) {
              second.deadReason.add(first);
              if (second.deadReason.size() == 1)
                  deadCount++;
          } else if (second.power > first.power) {
              first.deadReason.add(second);
              if (first.deadReason.size() == 1)
                  deadCount++;
          }
      }
  
      public static Nobleman get(final int i) {
          return noblemen[i];
      }
  
      public static void i(final int n) {
          if (noblemen != null)
              throw new IllegalStateException();
  
          noblemen = new Nobleman[n];
          for (int i = 0; i < n; i++)
              noblemen[i] = new Nobleman(i);
          deadCount = 0;
      }
  }
  
  @SuppressWarnings({"unused", "CommentedOutCode"})
  final class Helper {
      public static final String YES = "YES";
      public static final String NO = "NO";
  
      private Helper() {
          throw new UnsupportedOperationException();
      }
  
      public static BufferedReader newBufferedReader(final int bufferSize) {
          return new BufferedReader(new InputStreamReader(System.in), bufferSize);
      }
  
      public static BufferedWriter newBufferedWriter(final int bufferSize) {
          return new BufferedWriter(new OutputStreamWriter(System.out), bufferSize);
      }
  
      public static StringTokenizer spaceSplitter(final String s) {
          return new StringTokenizer(s, " ");
      }
  
      public static void repeat(int times, final Runnable runnable) {
          while (times-- > 0)
              runnable.run();
      }
  
      public static void fillArrays(final BufferedReader reader, final int[]... arrays) throws IOException {
          for (final int[] array : arrays) {
              final StringTokenizer tokenizer = spaceSplitter(reader.readLine());
              for (int i = 0; i < array.length; i++)
                  array[i] = Integer.parseInt(tokenizer.nextToken());
          }
      }
  
      public static void fillArrays(final BufferedReader reader, final long[]... arrays) throws IOException {
          for (final long[] array : arrays) {
              final StringTokenizer tokenizer = spaceSplitter(reader.readLine());
              for (int i = 0; i < array.length; i++)
                  array[i] = Long.parseLong(tokenizer.nextToken());
          }
      }
  
      /*
      public static long parseLong(final String token) {
          long result = 0L;
  
          if (token.isEmpty())
              return result;
  
          final boolean negative = token.charAt(0) == '-';
          for (int i = (negative ? 1 : 0); i < token.length(); ++i) {
              final char currentChar = token.charAt(i);
              if (currentChar < '0' || currentChar > '9')
                  throw new NumberFormatException("Expected a digit, found this: '" + currentChar + "' (i=" + i + ")");
  
              result += BigInteger.valueOf(token.charAt(i) - '0')
                      .multiply(BigInteger.valueOf((long) Math.pow(10, token.length() - i - 1))).longValue();
          }
  
          return negative ? -result : result;
      }
  
      public static int parseInt(final String token) {
          final long result = parseLong(token);
  
          if (result < Integer.MIN_VALUE || result > Integer.MAX_VALUE)
              throw new IllegalArgumentException("Provided argument is a number, " +
                      "but it can't be converted to an Integer due to its size: " + result);
  
          return (int) result;
      }
       */
  }
  