#include<bits/stdc++.h>
using namespace std;
const int N=3e5+5;int n,m;
int rt,lc[N*2],rc[N*2],fa[N*2];
int sz[N*2],sm[N*2],mi[N*2],k[N*2];
mt19937 rnnd(time(0));

void nnd(int p){
	sz[p]=1,sm[p]=(p<=m);
	mi[p]=p>m?p-m:p,k[p]=rnnd();
}

void pushup(int p){
	sz[p]=sz[lc[p]]+sz[rc[p]]+1;
	sm[p]=sm[lc[p]]+sm[rc[p]]+(p<=m);
	mi[p]=min({mi[lc[p]],mi[rc[p]],(p>m?p-m:p)});
}

void split(int p,int v,int &x,int &y){
	if(!p){x=y=0;return;}
	if(sz[lc[p]]+1<=v){
		fa[rc[p]]=0;x=p;
		split(rc[p],v-sz[lc[p]]-1,rc[x],y);
		fa[rc[x]]=x;pushup(x);
	}else{
		fa[lc[p]]=0;y=p;
		split(lc[p],v,x,lc[y]);
		fa[lc[y]]=y;pushup(y);
	}
}

int merge(int x,int y){
	if(!x||!y)return x|y;
	if(k[x]<k[y])return fa[rc[x]]=0,rc[x]=merge(rc[x],y),fa[rc[x]]=x,pushup(x),x;
	else return fa[lc[y]]=0,lc[y]=merge(x,lc[y]),fa[lc[y]]=y,pushup(y),y;
}

int rnk(int x,int t){
	int res=0,nw=1;while(x){//cout<<x<<"\n";
		if(nw)res+=(t?sm[lc[x]]+(x<=n):sz[lc[x]]+1);
		nw=(rc[fa[x]]==x);x=fa[x];
	}return res;
}

int find(int x,int v){if(x==0)return 0;
	if(mi[lc[x]]>=v&&x%m>=v)return sz[lc[x]]+1+find(rc[x],v);
	else if(mi[lc[x]]>=v)return sz[lc[x]];else return find(lc[x],v);
}

void print(int x){
	if(!x)return;print(lc[x]);
	cout<<x<<" "<<fa[x]<<" "<<lc[x]<<" "<<rc[x]<<" "<<sz[x]<<" "<<sm[x]<<" "<<mi[x]<<"\n";print(rc[x]);
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0); int c;
	cin>>c>>m; int op,x,y,u,v,w; mi[0]=1e9;
	for(int i=1;i<=m;i++){
		cin>>op>>x;
		if(op==1){
			n++;nnd(n);nnd(n+m);
			y=rnk(x,0);split(rt,y,u,v);//print(u),print(v);
			rt=merge(u,merge(n,merge(n+m,v)));
		}if(op==2){cin>>y;
			if(x!=0)split(rt,rnk(x,0)-1,u,v);
			else u=0,v=rt;//cout<<find(v,x)<<'\n';
			split(v,find(v,x),v,w);
			rt=merge(u,w);y=rnk(y,0);
			split(rt,y,u,w);
			x=find(w,x);split(w,x,w,y);
			rt=merge(merge(u,w),merge(v,y));
		}if(op==3)cout<<rnk(x,1)<<"\n";//print(rt);
	}return 0;
}