#include <bits/stdc++.h>

#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T> void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T> void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 1000010;

int n, m, ty, bel[maxn], fr[maxn], vis[maxn], tot;
ll pre[maxn], sum, lst;
set<int> e[maxn], S[maxn];
set<int>::iterator cur[maxn];
queue<int> qx, qy;

void flush(int x) {
  while (cur[x] != S[x].end() && vis[*cur[x]]) cur[x]++;
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> ty >> n >> m;
  rep (i, 1, n) S[i].insert(i), bel[i] = i;
  tot = n;
  rep (i, 1, m) {
    int op;
    ll x, y;
    cin >> op >> x;
    if (op != 3) cin >> y;
    if (ty) x ^= lst, y ^= lst;
    pre[i] = pre[i - 1];
    if (op == 1) {
      e[x].insert(y), e[y].insert(x);
      sum += 1ll * SZ(S[bel[x]]) * SZ(S[bel[y]]);
      if (SZ(S[bel[x]]) < SZ(S[bel[y]])) swap(x, y);
      for (int o : S[bel[y]]) S[bel[x]].insert(o), bel[o] = bel[x];
    } else if (op == 2) {
      e[x].erase(y), e[y].erase(x);
      vector<int> vx, vy;
      fr[x] = -1, fr[y] = -1, qx.emplace(x), qy.emplace(y);
      while (!qx.empty() && !qy.empty()) {
        int u = qx.front();
        qx.pop(), vx.emplace_back(u), vis[u] = 1;
        cur[u] = e[u].begin(), flush(u), fr[u] != -1 ? flush(fr[u]) : void();
        if (cur[u] != e[u].end()) fr[*cur[u]] = u, qx.emplace(*(cur[u]++));
        if (fr[u] != -1 && cur[fr[u]] != e[fr[u]].end()) fr[*cur[fr[u]]] = fr[u], qx.emplace(*(cur[fr[u]]++));
        int v = qy.front();
        qy.pop(), vy.emplace_back(v), vis[v] = 1;
        cur[v] = e[v].begin(), flush(v), fr[v] != -1 ? flush(fr[v]) : void();
        if (cur[v] != e[v].end()) fr[*cur[v]] = v, qy.emplace(*(cur[v]++));
        if (fr[v] != -1 && cur[fr[v]] != e[fr[v]].end()) fr[*cur[fr[v]]] = fr[v], qy.emplace(*(cur[fr[v]]++));
      }
      if (!qx.empty()) swap(x, y), swap(vx, vy), swap(qx, qy);
      tot++;
      for (int o : vx) bel[o] = tot, S[bel[y]].erase(o), S[tot].insert(o);
      pre[i] += 1ll * SZ(S[bel[y]]) * SZ(S[tot]);
      for (int o : vx) vis[o] = 0;
      for (int o : vy) vis[o] = 0;
      while (!qy.empty()) qy.pop();
    } else {
      cout << (lst = sum - pre[max(0ll, i - x - 1)]) << '\n';
    }
  }
}