#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int E;
    cin >> E;

    int n, q;
    cin >> n >> q;

    vector<set<int>> adj(n);
    auto dfs = [&](auto self, int v, int par) -> int {
        int s = 1;
        for (int to : adj[v]) {
            if (to != par) {
                s += self(self, to, v);
            }
        }
        return s;
    };

    ll q3 = 0;
    vector<ll> add(q + 1), after(q + 1);
    for (int i = 1; i <= q; ++i) {
        int type;
        cin >> type;
        after[i] = after[i - 1];
        if (type == 1) {
            ll x, y;
            cin >> x >> y;
            if (E) {
                x ^= q3, y ^= q3;
            }
            --x, --y;
            int szx = dfs(dfs, x, -1);
            int szy = dfs(dfs, y, -1);
            after[i] += 1LL * szx * szy;
            add[i] = 1LL * szx * szy;
            adj[x].insert(y);
            adj[y].insert(x);
        } else if (type == 2) {
            ll x, y;
            cin >> x >> y;
            if (E) {
                x ^= q3, y ^= q3;
            }
            --x, --y;
            adj[x].extract(y);
            adj[y].extract(x);
            int szx = dfs(dfs, x, -1);
            int szy = dfs(dfs, y, -1);
            after[i] -= 1LL * szx * szy;
        } else {
            ll t;
            cin >> t;
            if (E) {
                t ^= q3;
            }
            ll sum = after[i - t];
            for (int k = i - t; k <= i; ++k) {
                sum += add[k];
            }
            cout << sum << '\n';
            q3 = sum;
        }
    }

    return 0;
}