#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define db double
#define fi first
#define se second
#define inf 0x3f3f3f3f
#define vi vector<int>
using namespace std;
const int N=3e5+5;
int sub,n,cnt=1,rt=1;
mt19937 gen(114514);
struct node{
    int l,r,sz,mi,fix,fa;
}t[N];
void pushup(int p){
    t[p].mi=min(min(t[t[p].l].mi,t[t[p].r].mi),p);
    t[p].sz=t[t[p].l].sz+t[t[p].r].sz+1;
}
void split(int rt,int &x,int &y,int val){
    if(!rt){
        x=y=0;
        return;
    }
    if(t[t[rt].l].sz+1<=val){
        x=rt;
        split(t[x].r,t[x].r,y,val-t[t[x].l].sz-1);
        if(t[x].r)t[t[x].r].fa=x;
        pushup(x);
    }
    else{
        y=rt;
        split(t[y].l,x,t[y].l,val);
        if(t[y].l)t[t[y].l].fa=y;
        pushup(y);
    }
}
void dfs(int x){
    if(!x)return;
    dfs(t[x].l);
    cout<<x<<" ";
    dfs(t[x].r);
}
int merge(int x,int y){
    if(!x||!y)return x+y;
    if(t[x].fix>t[y].fix){
        t[x].r=merge(t[x].r,y);
        if(t[x].r)t[t[x].r].fa=x;
        pushup(x);
        return x;
    }
    else{
        t[y].l=merge(x,t[y].l);
        if(t[y].l)t[t[y].l].fa=y;
        pushup(y);
        return y;
    }
}
int getrank(int x){
    int tot=t[t[x].l].sz+1;
    while(t[x].fa){
        int y=t[x].fa;
        if(x==t[y].r)tot+=t[t[y].l].sz+1;
        x=y;
    }return tot;
}
int qry(int rt,int x){
    if(!rt)return 0;
    if(t[t[rt].l].mi>=x&&rt>=x)return qry(t[rt].r,x)+t[t[rt].l].sz+1;
    if(t[t[rt].l].mi>=x)return t[t[rt].l].sz;
    return qry(t[rt].l,x);
}
signed main(){
    //freopen("data.in","r",stdin);
    //freopen("variance.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    cin>>sub>>n,t[0].mi=inf;
    for(int i=1;i<=n+1;i++)t[i].sz=1,t[i].mi=i,t[i].fix=gen();
    for(int i=1;i<=n;i++){
        int op,u,v;
        cin>>op>>u;
        if(op==1){
            u++,cnt++;
            int val=getrank(u),x,y;
            split(rt,x,y,val);
            rt=merge(merge(x,cnt),y);
        }
        else if(op==2){
            cin>>v;
            u++,v++;
            int val=getrank(u),x,y,z,w;
            //cout<<val<<"\n";
            split(rt,x,y,val-1);
            int tmp=qry(y,u);
            split(y,y,z,tmp);
            x=merge(x,z);
            //dfs(x);
            val=getrank(v);
            //cout<<val<<"\n";
            split(x,x,z,val);
            tmp=qry(z,u);
            //cout<<tmp<<"\n";
            split(z,z,w,tmp);
            //cout<<t[x].sz<<" "<<t[z].sz<<" "<<t[y].sz<<" "<<t[w].sz<<"\n";
            rt=merge(merge(x,z),merge(y,w));
        }
        else{
            u++;
            int val=getrank(u),x,y;
            split(rt,x,y,val);
            rt=merge(x,y);
            cout<<val-1<<"\n";
        }
        //cout<<t[rt].sz<<"\n";
        // dfs(rt);
        // cout<<"\n";
    }
}