// what is matter? never mind. 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define int long long
#define ull unsigned long long
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(),(x).end()
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 500005
#define inf 0x3f3f3f3f

int O,n,q;

set<int>e[maxn],c[maxn*2];
struct node{
	int u,pa;
	set<int>::iterator it;
};

int res1[maxn*3],res2[maxn*3];
int fa[maxn*2],idx;

int add(int u,int v){
//	cout<<"add "<<u<<" "<<v<<"\n";
	e[u].insert(v),e[v].insert(u);
	int fu=fa[u],fv=fa[v];
	if(c[fu].size()<c[fv].size())swap(u,v);
	int ans=c[fu].size()*c[fv].size();
	for(int x:c[fv]) c[fu].insert(x),fa[x]=fu;
	c[fv].clear();
//	cout<<"ans "<<ans<<"\n";
	return ans;
}

int del(int u,int v){
	e[u].erase(v),e[v].erase(u);
	
	queue<node>q[2];
	set<int>s[2];
	s[0].insert(u),s[1].insert(v);
	if(e[u].size()) q[0].push((node){u,0,e[u].begin()});
	if(e[v].size()) q[1].push((node){v,1,e[v].begin()});
	
	while(q[0].size() && q[1].size()) {
		int o=(s[1].size()<s[0].size());
		auto [u,pa,it]=q[o].front(); q[o].pop();
		int v=*it;
		if(v!=pa && !s[o].count(v)){
			s[o].insert(v);
			if(e[v].size()) q[o].push({v,u,e[v].begin()});
		}
		++it;
		if(it!=e[u].end()) q[o].push({u,pa,it});
	}
	if(!q[0].size() && (q[1].size() || s[0].size()<s[1].size())) swap(u,v),swap(s[0],s[1]);
	
	int fu=fa[u];
	int ans=s[1].size()*(c[fu].size()-s[1].size());
	++idx;
	c[idx]=s[1];
	for(int x:s[1]) fa[x]=idx,c[fu].erase(x);
	
	return ans;
}

signed main()
{
//	freopen("my.out","w",stdout);
	O=read(),n=read(),q=read(); idx=n;
	For(i,1,n) c[i].insert(i),fa[i]=i;
	int lst=0;
	For(i,1,q){
		int op=read();
		res1[i]=res1[i-1],res2[i]=res2[i-1];
		if(op==1){
			int u=read(),v=read();
			if(O)u^=lst,v^=lst;
			res1[i]+=add(u,v);
		}
		if(op==2){
			int u=read(),v=read();
			if(O)u^=lst,v^=lst;
			res2[i]+=del(u,v);
		}
		if(op==3){
			int t=read();
			if(O)t^=lst;
			lst=res1[i]-res2[i-t];
			cout<<lst<<"\n";
		}
	}
	return 0;
}
/*
*/