#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 uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

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

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

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int online;
int n,m,q;
mt19937 rnd(0);

struct solver{
	ll answer;
	int fa[500005],siz[500005];
	struct node{
		int rev,sum,val,siz,l,r,w,fa;
	}tree[500005];
	#define ls(rt) tree[rt].l
	#define rs(rt) tree[rt].r
	void pushup(int rt){
		tree[rt].sum = tree[rt].val + tree[ls(rt)].sum + tree[rs(rt)].sum;
		tree[rt].siz = 1 + tree[ls(rt)].siz + tree[rs(rt)].siz;
	}
	void upd(int rt,int C){
		if(!C) return;
		tree[rt].rev ^= 1;
		swap(ls(rt),rs(rt));
	}
	void pushdown(int rt){
		if(!tree[rt].rev) return;
		upd(ls(rt),1);upd(rs(rt),1);
		tree[rt].rev = 0;
	}
	void ssplit(int rt,int k,int &x,int &y){
		if(!rt){
			x = y = 0;
			return;
		}
		pushdown(rt);
		if(k >= tree[ls(rt)].siz + 1){
			x = rt;
			ssplit(rs(rt),k - tree[ls(rt)].siz - 1,rs(rt),y);
			if(rs(rt)) tree[rs(rt)].fa = rt;
		}else{
			y = rt;
			ssplit(ls(rt),k,x,ls(rt));
			if(ls(rt)) tree[ls(rt)].fa = rt;
		}
		pushup(rt);
	}
	void split(int rt,int k,int &x,int &y){
		x = y = 0;
		ssplit(rt,k,x,y);
		tree[x].fa = tree[y].fa = 0;
	}
	int Merge(int x,int y){
		if(!x || !y) return x + y;
		if(tree[x].w < tree[y].w){
			pushdown(x);
			rs(x) = Merge(rs(x),y);
			tree[rs(x)].fa = x;
			pushup(x);
			return x;
		}else{
			pushdown(y);
			ls(y) = Merge(x,ls(y));
			tree[ls(y)].fa = y;
			pushup(y);
			return y;
		}
	}
	int top;
	int stk[50];
	void fix(int u){
		while(u){
			stk[++top] = u;
			u = tree[u].fa;
		}
		while(top) pushdown(stk[top--]);
	}
	void refix(int u){
		tree[u].val = siz[u];
		while(u){
			pushup(u);
			u = tree[u].fa;
		}
	}
	int getrank(int u){
		fix(u);
		int sum = 1 + tree[ls(u)].siz,v;
		while(u){
			v = tree[u].fa;
			if(u == rs(v)) sum += tree[ls(v)].siz;
			u = v;
		}
		return sum;
	}
	int getrt(int u){
		while(tree[u].fa) u = tree[u].fa;
		return u;
	}
	int gettop(int u){
		u = getrt(u);
		while(1){
			pushdown(u);
			if(ls(u)) u = ls(u);
			else return u;
		}
	}
	void prt(int u){
		printf("node %d ls %d rs %d fa %d rev %d val %d sum %d siz %d\n",u,ls(u),rs(u),tree[u].fa,tree[u].rev,tree[u].val,tree[u].sum,tree[u].siz);
	}
	void travel(int u){
		if(ls(u)) travel(ls(u));
		prt(u);
		if(rs(u)) travel(rs(u));
 	}
	void access(int u){
//		printf("access %d\n",u);
		int temp = getrank(u),rt = getrt(u),a,b;
//		printf("temp=%d\n",temp);
		if(tree[rt].siz != temp){
			split(rt,temp,a,b);
/*			printf("travela\n");
			travel(a);
			printf("travelb\n");
			travel(b);
			printf("fin\n");*/
			siz[u] += tree[b].sum;
			fa[gettop(b)] = u;
			refix(u);
		}
//		printf("part\n");
//		dbg();
		while(1){
			int v = gettop(u);
			if(!fa[v]){
//				printf("fin\n");
//				dbg();
				return;
			}
			rt = getrt(fa[v]);
			temp = getrank(fa[v]);
			if(tree[rt].siz != temp){
				split(rt,temp,a,b);
				siz[fa[v]] += tree[b].sum;
				fa[gettop(b)] = fa[v];
				rt = a;
			}
			siz[fa[v]] -= tree[getrt(u)].sum;
			refix(fa[v]);
			fa[v] = 0;
			Merge(rt,getrt(u));
		}
	}
	void makeroot(int u){
		access(u);
		upd(getrt(u),1);
	}
	void dbg(){
		rep(u,1,n) prt(u);
		printf("extra structor\n");
		rep(u,1,n) printf("%d ",fa[u]);
		printf("\n");
		rep(u,1,n) printf("%d ",siz[u]);
		printf("\n");
	}
	void link(int u,int v){
//		printf("link %d %d\n",u,v);
		makeroot(u);
		makeroot(v);
		answer += 1ll * tree[getrt(u)].sum * tree[getrt(v)].sum;
		fa[v] = u;siz[u] += tree[getrt(v)].sum;
		refix(u);
//		printf("[fin answer=%lld]\n",answer);
//		dbg();
	}
	void cut(int u,int v){
//		printf("[[[[[[[[[[[cut %d %d]]]]]]]]]]\n",u,v);
		makeroot(u);
		access(v);access(u);
		answer -= 1ll * (tree[getrt(u)].sum - tree[getrt(v)].sum) * tree[getrt(v)].sum;
		fa[v] = 0;siz[u] -= tree[getrt(v)].sum;
		refix(u);
//		printf("[fin answer=%lld]\n",answer);
//		dbg();
	}
	void init(){
		rep(u,1,n){
			siz[u] = tree[u].sum = tree[u].val = 1;
			tree[u].siz = 1;
			tree[u].w = rnd();
		}
	}
}P,Q;
ll a[6005],b[6005];
ll calc(int l,int r){
	ll sum = 0;
	rep(i,l,r) sum += a[i];
	rep(i,l + 1,r) sum -= b[i];
	return sum;
}

int main(){	
//	freopen("test.in","r",stdin);
	scanf("%d%d%d",&online,&n,&q);
	P.init();
	Q.init();
	int op;
	ll x,y,lastans = 0;
	rep(i,1,q){
		scanf("%d%lld",&op,&x);
		if(op < 3) scanf("%lld",&y);
		if(online){
			x ^= lastans;
			y ^= lastans;
		}
		if(op == 1){
			P.link(x,y);
		}else if(op == 2){
			P.cut(x,y);
			Q.cut(x,y);
		}
		a[i] = P.answer;
		b[i] = Q.answer;
		if(op == 1) Q.link(x,y);
		if(op == 3){
			lastans = calc(i - x,i);
			printf("%lld\n",lastans);
		}
	}
	return 0;
}