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.BufferedReader;
  import java.io.IOException;
  import java.io.InputStream;
  import java.io.InputStreamReader;
  import java.io.PrintWriter;
  import java.util.*;
  import java.util.stream.IntStream;
  
  
  public class Main implements Runnable {
      int n, m, k;
      static boolean use_n_tests = false;
      long mod = 1_000_000_007;
      long mod1 = 998244353L;
  
      void solve(FastScanner in, PrintWriter out, int testNumber) {
          n = in.nextInt();
          m = in.nextInt();
          int[] vln = new int[n];
          int vlnSize = 0;
          for (int i = 0; i < m; i++) {
              int v = in.nextInt() - 1;
              int u = in.nextInt() - 1;
              if (v > u) {
                  if (vln[u] == 0) {
                      vlnSize++;
                  }
                  vln[u]++;
              } else {
                  if (vln[v] == 0) {
                      vlnSize++;
                  }
                  vln[v]++;
              }
          }
  
          int q = in.nextInt();
          for (int i = 0; i < q; i++) {
              int type = in.nextInt();
              if (type == 3) {
                  out.println(n - vlnSize);
              } else {
                  int u = in.nextInt() - 1;
                  int v = in.nextInt() - 1;
                  if (type == 1) {
                      if (v > u) {
                          if (vln[u] == 0) {
                              vlnSize++;
                          }
                          vln[u]++;
                      } else {
                          if (vln[v] == 0) {
                              vlnSize++;
                          }
                          vln[v]++;
                      }
                  } else {
                      if (v > u) {
                          if (vln[u] == 1) {
                              vlnSize--;
                          }
                          vln[u]--;
                      } else {
                          if (vln[v] == 1) {
                              vlnSize--;
                          }
                          vln[v]--;
                      }
                  }
              }
          }
      }
  
      // ****************************** template code ***********
  
      public static class DisjointSets {
          int[] p;
  
          DisjointSets(int size) {
              p = new int[size];
              for (int i = 0; i < size; i++)
                  p[i] = i;
          }
  
          public int root(int x) {
              return x == p[x] ? x : (p[x] = root(p[x]));
          }
  
          public void unite(int a, int b) {
              a = root(a);
              b = root(b);
              if (a != b)
                  p[a] = b;
          }
      }
  
      boolean triangleCheck(int a, int b, int c) {
          return a + b > c && a + c > b && b + c > a;
      }
  
      Map<Integer, Integer> numberCompression(List<Integer> ls) {
          Collections.sort(ls);
          int id = 1;
          Map<Integer, Integer> comp = new HashMap<>();
          for (int num : ls) {
              if (!comp.containsKey(num)) {
                  comp.put(num, id++);
              }
          }
          return comp;
      }
  
      long lcm(long a, long b) {
          return (a / gcd(a, b)) * b;
      }
  
      long gcd(long a, long b) {
          return b == 0 ? a : gcd(b, a % b);
      }
  
      class Pt {
          int x, y;
  
          boolean sameAxis(Pt b) {
              return b.x == x || b.y == y;
          }
  
          int manxDist(Pt b) {
              return Math.abs(x - b.x) + Math.abs(y - b.y);
          }
  
          void read() {
              x = in.nextInt();
              y = in.nextInt();
          }
      }
  
      void swap(Integer[] a, int i, int j) {
          Integer tmp = a[i];
          a[i] = a[j];
          a[j] = tmp;
      }
  
      void swap(List<Integer> a, int i, int j) {
          Integer tmp = a.get(i);
          a.set(i, a.get(j));
          a.set(j, tmp);
      }
  
      long manhDist(long x, long y, long x1, long y1) {
          return Math.abs(x - x1) + Math.abs(y - y1);
      }
  
      double dist(double x, double y, double x1, double y1) {
          return Math.sqrt(Math.pow(x - x1, 2.0) + Math.pow(y - y1, 2.0));
      }
  
      public static class FW {
          public static void add(long[] t, int i, long value) {
              for (; i < t.length; i |= i + 1)
                  t[i] += value;
          }
  
          public static long sum(long[] t, int i) {
              long res = 0;
              for (; i >= 0; i = (i & (i + 1)) - 1)
                  res += t[i];
              return res;
          }
  
          public static void add(long[] t, int a, int b, long value) {
              add(t, a, value);
              add(t, b + 1, -value);
          }
      }
  
      int sign(int a) {
          if (a < 0) {
              return -1;
          }
          return 1;
      }
  
      long binpow(long a, int b) {
          long res = 1;
          while (b != 0) {
              if (b % 2 == 0) {
                  b /= 2;
                  a *= a;
                  a %= mod;
              }
  
              b--;
              res *= a;
              res %= mod;
          }
          return res;
      }
  
      List<Integer> getDigits(long n) {
          List<Integer> res = new ArrayList<>();
          while (n != 0) {
              res.add((int) (n % 10L));
              n /= 10;
          }
          return res;
      }
  
      List<Integer> generatePrimes(int n) {
          List<Integer> res = new ArrayList<>();
          boolean[] sieve = new boolean[n + 1];
          for (int i = 2; i <= n; i++) {
              if (!sieve[i]) {
                  res.add(i);
              }
              if ((long) i * i <= n) {
                  for (int j = i * i; j <= n; j += i) {
                      sieve[j] = true;
                  }
              }
          }
          return res;
      }
  
      int[] ask(int l) {
          System.out.printf("? %d\n", l);
          System.out.flush();
          return in.nextArray(n);
      }
  
      static int stack_size = 1 << 29;
  
      static class Coeff {
          long mod;
          long[][] C;
          long[] fact;
          boolean cycleWay = false;
  
          Coeff(int n, long mod) {
              this.mod = mod;
              fact = new long[n + 1];
              fact[0] = 1;
              for (int i = 1; i <= n; i++) {
                  fact[i] = i;
                  fact[i] %= mod;
                  fact[i] *= fact[i - 1];
                  fact[i] %= mod;
              }
          }
  
          Coeff(int n, int m, long mod) {
              // n > m
              cycleWay = true;
              this.mod = mod;
              C = new long[n + 1][m + 1];
              for (int i = 0; i <= n; i++) {
                  for (int j = 0; j <= Math.min(i, m); j++) {
                      if (j == 0 || j == i) {
                          C[i][j] = 1;
                      } else {
                          C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
                          C[i][j] %= mod;
                      }
                  }
              }
          }
  
          public long C(int n, int m) {
              if (cycleWay) {
                  return C[n][m];
              }
              return fC(n, m);
          }
  
          private long fC(int n, int m) {
              return (fact[n] * inv(fact[n - m] * fact[m] % mod)) % mod;
          }
  
          private long inv(long r) {
              if (r == 1)
                  return 1;
              return ((mod - mod / r) * inv(mod % r)) % mod;
          }
      }
  
      class Pair {
          int first;
          long second;
  
          Pair(int f, long s) {
              first = f;
              second = s;
          }
  
          public int getFirst() {
              return first;
          }
  
          public long getSecond() {
              return second;
          }
      }
  
      class MultisetTree<T> {
          int size = 0;
  
          TreeMap<T, Integer> mp = new TreeMap<>();
  
          void add(T x) {
              mp.merge(x, 1, Integer::sum);
              size++;
          }
  
          void remove(T x) {
              if (mp.containsKey(x)) {
                  mp.merge(x, -1, Integer::sum);
                  if (mp.get(x) == 0) {
                      mp.remove(x);
                  }
                  size--;
              }
          }
  
          boolean contains(T x) {
              return mp.containsKey(x);
          }
  
          T greatest() {
              return mp.lastKey();
          }
  
          T higher(T x) {
              return mp.higherKey(x);
          }
  
          T smallest() {
              return mp.firstKey();
          }
  
          int size() {
              return size;
          }
  
          int diffSize() {
              return mp.size();
          }
      }
  
      class Multiset<T> {
          int size = 0;
  
          Map<T, Integer> mp = new HashMap<>();
  
          void add(T x) {
              mp.merge(x, 1, Integer::sum);
              size++;
          }
  
          boolean contains(T x) {
              return mp.containsKey(x);
          }
  
          void remove(T x) {
              if (mp.containsKey(x)) {
                  mp.merge(x, -1, Integer::sum);
                  if (mp.get(x) == 0) {
                      mp.remove(x);
                  }
                  size--;
              }
          }
  
          int size() {
              return size;
          }
  
          int diffSize() {
              return mp.size();
          }
      }
  
      static class Range {
          int l, r;
          int id;
  
          public int getL() {
              return l;
          }
  
          public int getR() {
              return r;
          }
  
          public Range(int l, int r, int id) {
              this.l = l;
              this.r = r;
              this.id = id;
          }
      }
  
      static class Array {
          static Range[] readRanges(int n, FastScanner in) {
              Range[] result = new Range[n];
              for (int i = 0; i < n; i++) {
                  result[i] = new Range(in.nextInt(), in.nextInt(), i);
              }
              return result;
          }
  
          static List<List<Integer>> intInit2D(int n) {
              List<List<Integer>> res = new ArrayList<>();
              for (int i = 0; i < n; i++) {
                  res.add(new ArrayList<>());
              }
              return res;
          }
  
          static boolean isSorted(Integer[] a) {
              for (int i = 0; i < a.length - 1; i++) {
                  if (a[i] > a[i + 1]) {
                      return false;
                  }
              }
              return true;
          }
  
          static public long sum(int[] a) {
              long sum = 0;
              for (int x : a) {
                  sum += x;
              }
              return sum;
          }
  
          static public long sum(long[] a) {
              long sum = 0;
              for (long x : a) {
                  sum += x;
              }
              return sum;
          }
  
          static public long sum(Integer[] a) {
              long sum = 0;
              for (int x : a) {
                  sum += x;
              }
              return sum;
          }
  
          static public int min(Integer[] a) {
              int mn = Integer.MAX_VALUE;
              for (int x : a) {
                  mn = Math.min(mn, x);
              }
              return mn;
          }
  
          static public int min(int[] a) {
              int mn = Integer.MAX_VALUE;
              for (int x : a) {
                  mn = Math.min(mn, x);
              }
              return mn;
          }
  
          static public int max(Integer[] a) {
              int mx = Integer.MIN_VALUE;
              for (int x : a) {
                  mx = Math.max(mx, x);
              }
              return mx;
          }
  
          static public int max(int[] a) {
              int mx = Integer.MIN_VALUE;
              for (int x : a) {
                  mx = Math.max(mx, x);
              }
              return mx;
          }
  
          static public int[] readint(int n, FastScanner in) {
              int[] out = new int[n];
              for (int i = 0; i < out.length; i++) {
                  out[i] = in.nextInt();
              }
              return out;
          }
      }
  
      class Graph {
          List<List<Integer>> graph;
  
          Graph(int n) {
              create(n);
          }
  
          private void create(int n) {
              List<List<Integer>> graph = new ArrayList<>();
              for (int i = 0; i < n; i++) {
                  graph.add(new ArrayList<>());
              }
              this.graph = graph;
          }
  
          int size() {
              return graph.size();
          }
  
          List<Integer> abj(int v) {
              return graph.get(v);
          }
  
          void read(int m, FastScanner in) {
              for (int i = 0; i < m; i++) {
                  int v = in.nextInt() - 1;
                  int u = in.nextInt() - 1;
                  graph.get(v).add(u);
              }
          }
  
          void readBi(int m, FastScanner in) {
              for (int i = 0; i < m; i++) {
                  int v = in.nextInt() - 1;
                  int u = in.nextInt() - 1;
                  addEdge(v, u);
              }
          }
  
          public void addEdge(int v, int u) {
              graph.get(v).add(u);
              graph.get(u).add(v);
          }
      }
  
      class FastScanner {
          BufferedReader br;
          StringTokenizer st;
  
          public FastScanner(InputStream io) {
              br = new BufferedReader(new InputStreamReader(io));
          }
  
          public String line() {
              String result = "";
              try {
                  result = br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return result;
          }
  
          public String next() {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
  
          public char[] nextc() {
              return next().toCharArray();
          }
  
          public int nextInt() {
              return Integer.parseInt(next());
          }
  
          public int[] nextArray(int n) {
              int[] res = new int[n];
              for (int i = 0; i < n; i++) {
                  res[i] = in.nextInt();
              }
              return res;
          }
  
          public long[] nextArrayL(int n) {
              long[] res = new long[n];
              for (int i = 0; i < n; i++) {
                  res[i] = in.nextLong();
              }
              return res;
          }
  
          public Long[] nextArrayL2(int n) {
              Long[] res = new Long[n];
              for (int i = 0; i < n; i++) {
                  res[i] = in.nextLong();
              }
              return res;
          }
  
  
          public Integer[] nextArray2(int n) {
              Integer[] res = new Integer[n];
              for (int i = 0; i < n; i++) {
                  res[i] = in.nextInt();
              }
              return res;
          }
  
          public long nextLong() {
              return Long.parseLong(next());
          }
  
      }
  
      void run_t_tests() {
          int t = in.nextInt();
          int i = 0;
          while (t-- > 0) {
              solve(in, out, i++);
          }
      }
  
      void run_one() {
          solve(in, out, -1);
      }
  
      @Override
      public void run() {
          in = new FastScanner(System.in);
          out = new PrintWriter(System.out);
          if (use_n_tests) {
              run_t_tests();
          } else {
              run_one();
          }
          out.close();
      }
  
      static FastScanner in;
      static PrintWriter out;
  
      public static void main(String[] args) throws InterruptedException {
          Thread thread = new Thread(null, new Main(), "", stack_size);
          thread.start();
          thread.join();
      }
  }