#include<iostream>
#include<cstdio>
#include<algorithm>
#define N 200002
using namespace std;
int tr[N][2],fa[N],size[N],w[N],cnt,n,m,tot,top,b[N],L[N],R[N],ji[N],qqq,ans,ans2[N];
inline int rd(){int x=0;char c=getchar();bool f=0;while(!isdigit(c)){if(c=='-')f=1;c=getchar();}while(isdigit(c)){x=(x<<1)+(x<<3)+(c^48);c=getchar();}return f?-x:x;
}
inline bool isroot(int x){return !x||(tr[fa[x]][0]!=x&&tr[fa[x]][1]!=x);}
inline bool ge(int x){return tr[fa[x]][1]==x;}
inline void pushup(int x){size[x]=size[tr[x][0]]+size[tr[x][1]]+w[x];}
inline void newnode(int x){++cnt;w[cnt]=size[cnt]=x;}
inline void rotate(int x){int y=fa[x],o=ge(x);if(isroot(x))return;tr[y][o]=tr[x][o^1];fa[tr[y][o]]=y;if(!isroot(y))tr[fa[y]][ge(y)]=x;fa[x]=fa[y];fa[y]=x;tr[x][o^1]=y;pushup(y);pushup(x);
}
inline void splay(int x){while(!isroot(x)){ int y=fa[x];if(isroot(y))rotate(x);else rotate(ge(y)==ge(x)?y:x),rotate(x);}
}
inline int access(int x){int y=0;for(;x;y=x,x=fa[x])splay(x),tr[x][1]=y,pushup(x);return y;}//qiu LCA get
inline void link(int x,int y){access(x);splay(x);fa[x]=y;}
inline void cut(int x){access(x);splay(x);fa[tr[x][0]]=0;tr[x][0]=0;pushup(x);}
struct node{int pos,tag,x,y;inline bool operator <(const node &b)const{if(pos!=b.pos)return pos<b.pos;else return tag<b.tag;}
}a[N<<1];
int main(){n=rd();m=rd();int opt,l,r,k;newnode(1);newnode(0);link(2,1);int now=2;b[tot=1]=1;L[tot]=1;R[tot]=n;for(int i=1;i<=m;++i){opt=rd();if(!opt){l=rd();r=rd();newnode(1);b[++tot]=cnt;L[tot]=l;R[tot]=r;a[++top]=node{1,i-N,cnt,now};}else if(opt==1){l=rd();r=rd();k=rd();l=max(l,L[k]);r=min(r,R[k]);if(l>r)continue;newnode(0);link(cnt,now);a[++top]=node{l,i-N,cnt,b[k]};a[++top]=node{r+1,i-N,cnt,now};now=cnt;}else{k=rd();l=rd();r=rd();ji[i]=++qqq;a[++top]=node{k,i,b[l],b[r]};}} sort(a+1,a+top+1);int p=1;for(int i=1;i<=n;++i)for(;a[p].pos==i;++p)if(a[p].tag<=0){cut(a[p].x);link(a[p].x,a[p].y);}else{ans=0;access(a[p].x);splay(a[p].x);ans+=size[a[p].x];int lca=access(a[p].y);splay(a[p].y);ans+=size[a[p].y];access(lca);splay(lca);ans-=size[lca]*2;ans2[ji[a[p].tag]]=ans;}for(int i=1;i<=qqq;++i)printf("%d\n",ans2[i]);return 0;
}