#pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
//#define int long long
using namespace __gnu_pbds;
using namespace std;

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

const int block=500;

int n,m,f[300010],_f[300010],_g[300010],tag[1010];

inline void recalc(int id)
{
	int L=(id-1)*block+1,R=min(id*block,m);
	for(int i=R;i>=L;i--){
		if(f[i]>R) _f[i]=f[i],_g[i]=1;
		else _f[i]=_f[f[i]],_g[i]=_g[f[i]]+1;
	}
}

inline void update(int L,int R,int val)
{
	int idl=(L-1)/block+1,idr=(R-1)/block+1;
	if(idl==idr){
		if(tag[idl]){
			for(int i=(idl-1)*block+1;i<=min(idl*block,m);i++) f[i]=tag[idl];
			tag[idl]=0;
		}
		for(int i=L;i<=R;i++) f[i]=val;
		recalc(idl);
	}
	else{
		if(tag[idl]){
			for(int i=(idl-1)*block+1;i<=min(idl*block,m);i++) f[i]=tag[idl];
			tag[idl]=0;
		}
		for(int i=L;i<=min(idl*block,m);i++) f[i]=val;
		recalc(idl);
		for(int i=idl+1;i<=idr-1;i++) tag[i]=val;
		if(tag[idr]){
			for(int i=(idr-1)*block+1;i<=min(idr*block,m);i++) f[i]=tag[idr];
			tag[idr]=0;
		}
		for(int i=(idr-1)*block+1;i<=R;i++) f[i]=val;
		recalc(idr);
	}
}

signed main()
{
	ios::sync_with_stdio(false);cin.tie(0);
	cin>>n>>m;
	for(int i=1;i<=m;i++) f[i]=m+1,_f[i]=m+1,_g[i]=1;
	for(int i=1;i<=(m-1)/block+1;i++) tag[i]=0;
	set<pair<int,int> > s;
	set<pair<int,int> >::iterator it;
	for(int i=1;i<=n;i++){
		int flag;cin>>flag;
		if(flag==1){
			int l,r;cin>>l>>r;
			it=s.lower_bound(make_pair(l,0));
			if(it!=s.end()&&(it->second)<=r) continue;
			it=s.lower_bound(make_pair(l+1,0));
			if(it!=s.begin()){
				it--;
				vector<pair<int,int> > del;
				while(true){
					if((it->second)>=r) del.push_back(*it);
					if(it==s.begin()) break;
					it--;
				}
				for(int j=0;j<(int)del.size();j++) s.erase(s.find(del[j]));
			}
			s.insert(make_pair(l,r));
			it=s.lower_bound(make_pair(l,r));
			int pre;
			if(it==s.begin()) pre=1;
			else{
				it--;pre=(it->first);
			}
			update(pre,l-1,r);
		}
		else{
			int l,r;cin>>l>>r;
			it=s.lower_bound(make_pair(l,0));
			if(it==s.end()||(it->second)>r){
				cout<<0<<'\n';continue;
			}
			int now=(it->second),cnt=1;
			while(now<=r){
				if((now-1)/block+1!=(r-1)/block+1){
					if(tag[(now-1)/block+1]) cnt++,now=tag[(now-1)/block+1];
					else cnt+=_g[now],now=_f[now];
				}
				else{
					if(tag[(now-1)/block+1]) cnt++,now=tag[(now-1)/block+1];
					else cnt++,now=f[now];
				}
			}
			cnt--;
			cout<<cnt<<'\n';
		}
	}
	return 0;
}