#include<bits/stdc++.h>
#define ll long long
using namespace std;
int e,n,q,op,x,y,t,f[1500001],cnt;
ll ans;
map<pair<int,int>,int> m;
struct node{
    int num,x,y;
}a[1500001];
int ff(int num){
    int cntt=cnt,res=0;
    while(cntt>0&&a[cntt].num>=num){
        if(m[{a[cntt].x,a[cntt].y}]==0){
            res++;
            m[{a[cntt].x,a[cntt].y}]=1;
        }
        cntt--;
    }
    return res;
}
int main(){
    freopen("communication.in","r",stdin);
    freopen("communication.out","w",stdout);
    cin>>e>>n>>q;
    for(int i=1;i<=q;i++){
        cin>>op;
        if(op==1){
            cin>>x>>y;
            if(e==1){
                x^=ans;
                y^=ans;
            }
            a[++cnt]={i,x,y};
            f[i]=f[i-1]+1;
        }else if(op==2){
            cin>>x>>y;
            if(e==1){
                x^=ans;
                y^=ans;
            }
            f[i]=f[i-1]-1;
        }else{
            cin>>t;
            cout<<1<<endl;
        }
    }
    return 0;
}