#include <bits/stdc++.h>

using namespace std;

const int N = 5e5 + 5, Q = 1.5e6 + 5;

int cnt, wh[Q], siz[Q];
long long add[Q], del[Q];
set<int> G[N];

void color(int x, int y) {
    wh[x] = y;
    for (auto z : G[x]) {
        if (wh[z] != y) color(z, y);
    }
}

long long link(int x, int y) {
    if (siz[wh[x]] > siz[wh[y]]) swap(x, y);
    long long res = 1ll * siz[wh[x]] * siz[wh[y]];
    G[x].insert(y), G[y].insert(x);
    siz[wh[y]] += siz[wh[x]];
    color(x, wh[y]);
    return res;
}

long long cut(int x, int y) {
    G[x].erase(y), G[y].erase(x);
    queue< tuple<int, int, set<int>::iterator> > Q[2];
    vector<int> p[2];
    Q[0].push({x, 0, G[x].begin()}), Q[1].push({y, 0, G[y].begin()});
    for (int i = 0; !Q[i].empty(); i ^= 1) {
        auto [a, b, c] = Q[i].front(); Q[i].pop();
        if (c == G[a].begin()) p[i].push_back(a);
        while (c != G[a].end() && *c == b) ++c;
        if (c != G[a].end()) {
            Q[i].push({*c, a, G[*c].begin()});
            Q[i].push({a, b, next(c)});
        }
    }
    if (!Q[0].empty()) swap(Q[0], Q[1]), swap(p[0], p[1]);
    ++cnt;
    for (auto v : p[0]) {
        wh[v] = cnt;
    }
    siz[cnt] = p[0].size(), siz[wh[p[1][0]]] -= p[0].size();
    return 1ll * siz[x] * siz[y];
}

signed main() {
    int E, n, q; scanf("%d%d%d", &E, &n, &q);
    cnt = n;
    for (int i = 1; i <= n; ++i) wh[i] = i, siz[i] = 1;
    long long ans = 0;
    for (int i = 1; i <= q; ++i) {
        add[i] = add[i - 1], del[i] = del[i - 1];
        int opt; scanf("%d", &opt);
        if (opt == 1) {
            long long x, y; scanf("%lld%lld", &x, &y);
            if (E) x ^= ans, y ^= ans;
            add[i] += link(x, y);
        } else if (opt == 2) {
            long long x, y; scanf("%lld%lld", &x, &y);
            if (E) x ^= ans, y ^= ans;
            del[i] += cut(x, y);
        } else {
            long long x; scanf("%lld", &x);
            if (E) x ^= ans;
            printf("%lld\n", ans = add[i] - del[i - x]);
        }
    }
    return 0;
}