#include<bits/stdc++.h>
using namespace std;
const int N=2e6+500;

int v[N],s[N],mi[N],ch[N][2],rev[N],f[N];

#define ls ch[x][0]
#define rs ch[x][1]

int isroot(int x){return ch[f[x]][0]==x|ch[f[x]][1]==x;}//rev 0,1
void up(int x){s[x]=s[ls]+s[rs]+v[x];mi[x]=min(x,min(mi[ls],mi[rs]));}
void reversal(int x){swap(ls,rs);rev[x]^=1;}
void down(int x){if(!rev[x])return;reversal(ls),reversal(rs);rev[x]=0;}
void rotate(int x)
{
	int y=f[x],z=f[y],k=(ch[y][1]==x),w=(ch[z][1]==y),an=ch[x][k^1];
	if(isroot(y))ch[z][w]=x;ch[x][k^1]=y;ch[y][k]=an;
	if(an)f[an]=y;f[y]=x,f[x]=z;
	up(y);up(x);
}

int st[N];

void splay(int x)
{
	int y=x,z=0;
	st[++z]=x;
	while(isroot(y))st[++z]=y=f[y];
	while(z)down(st[z--]);
	while(isroot(x))
	{
		y=f[x],z=f[y];
		if(isroot(y))rotate((ch[y][1]==x)^(ch[z][1]==y)?x:y);
		rotate(x);
	}
	up(x);
}

void access(int x){for(int y=0;x;x=f[y=x])splay(x),rs=y,up(x);}
void make_root(int x){access(x);splay(x);reversal(x);}
int find_root(int x){access(x);splay(x);while(ls)down(x),x=ls;splay(x);return x;}
void split(int x,int y){make_root(x);access(y);splay(y);}
void link(int x,int y){make_root(x);if(find_root(y)!=x)f[x]=y;}
void cut(int x,int y){make_root(x);if(find_root(y)==x&&f[y]==x&&!ch[y][0])f[y]=rs=0,up(x);}

int n,m;

char cch,B0[1<<15],*S=B0,*T=B0;
#define getc() (S==T&&(T=(S=B0)+fread(B0,1,1<<15,stdin),S==T)?0:*S++)
int aa;int read(){
	while(cch=getc(),cch<'0'||cch>'9');aa=cch-'0';
	while(cch=getc(),cch>='0'&&cch<='9')aa=((aa<<3)+(aa<<1))+cch-'0';return aa;
}

set<int>t;
int to[N];

void change(int x,int y,int w)
{
	// cout<<"change "<<x<<' '<<y<<' '<<w<<'\n';
	splay(x);v[x]=w;s[x]=s[ls]+s[rs]+w;cut(x,to[x]);link(x,to[x]=y);
}

void merge(int l,int p)
{
	auto it=lower_bound(t.begin(),t.end(),l);
	if(to[*it]<p)return;
	auto ed=it;
	while(it!=t.begin())
	{
		--it;
		if(to[*it]<=p)break;
		change(*it,(*it)+1,0);
	}
	it++;t.erase(it,ed);change(l,p,1);t.insert(l);
}

void dfs(int x)
{
	down(x);
	if(ls)dfs(ls);
	if(rs)dfs(rs);
}

int find(int x,int r)
{
	if(!x)return 0;
	down(x);
	// cout<<"find "<<x<<' '<<ls<<' '<<rs<<' '<<mi[ls]<<' '<<mi[rs]<<' '<<s[x]<<' '<<v[x]<<'\n';
	// if(!ls&&!rs)return 0;
	if(mi[rs]<=r)return s[ls]+v[x]+find(rs,r);
	if(x<=r)return s[ls];
	return find(ls,r);
}

int main()
{
	// freopen("in","r",stdin);
	m=read(),n=read();mi[0]=1e9;
	for(int i=1;i<=n;i++)f[i]=to[i]=i+1;make_root(n+1);
	t.insert(n);to[n]=n+1;t.insert(0);
	while(m--)
	{
		int opt=read(),l=read(),r=read();
		if(opt==1)merge(l,r+1);
		else
		{
			split(l,n+1);
			// dfs(n+1);
			cout<<find(n+1,r+1)<<'\n';
			// if(m>10000)return 0;m=19999999;
		}
	}
}