#include <bits/stdc++.h>
#define pii pair <int, int>
#define fi first
#define se second

using namespace std;
const int N = 3e5+5, B = 3e5+5, b = 175, inf = 0x3f3f3f3f;
int n, m, nxt[N], nb[N], d[N], rk[N], lb[B], rb[B], o[B], od[B]; 
set <pii> st; 

void reset (int bi, int l, int r, int k) {
	if (o[bi]) {
		for (int j = rb[bi];j >= lb[bi];j--) nxt[j] = od[bi], d[j] = 1; 
		o[bi] = 0;
	}
	for (int j = l;j <= r;j++) nxt[j] = k; 
	for (int j = rb[bi];j >= lb[bi];j--) {
		if (nxt[j] > rb[bi]) nb[j] = nxt[j], d[j] = 1; 
		else nb[j] = nb[nxt[j]], d[j] = d[nxt[j]]+1; 
	}
}

void upd (int l, int r, int k) {
//	cout << "MODIFY:" << l << " " << r << " " << k << endl; 
	int bl = rk[l], br = rk[r]; 
	if (bl == br) {
		return reset(bl, l, r, k);
	} 
	reset(bl, l, rb[bl], k); reset(br, lb[br], r, k);
	for (int j = bl+1;j < br;j++) o[j] = 1, od[j] = k; 
}

int getd (int l, int r) {
	int k = 0; 
	while (1) {
		if (o[rk[l]]) {
			if (od[rk[l]] > r+1) break;
			k++; l = od[rk[l]]; 
		}
		else {
			if (nb[l] > r+1) break; 
			k += d[l]; l = nb[l]; 
		}
	}
	while (1) {
		if (o[rk[l]]) {
			if (od[rk[l]] > r+1) break; 
			k++; l = od[rk[l]]; 
		}
		else {
			if (nxt[l] > r+1) break; 
			k++; l = nxt[l]; 
		}
	}
	return k; 
}

int main () {
	ios::sync_with_stdio(0); 
	cin.tie(0); cout.tie(0); 
	cin >> m >> n; 
	for (int i = 1; ;i++) {
		lb[i] = rb[i-1]+1; rb[i] = min(n, rb[i-1]+b);
		for (int j = lb[i];j <= rb[i];j++) rk[j] = i; 
		if (rb[i] == n) break;  
	}
	for (int i = 1;i <= n+1;i++) nxt[i] = nb[i] = inf; 
	while (m--) {
		int o, l, r; cin >> o >> l >> r; 
		if (o == 1) {
			auto it = st.upper_bound({r+1, 0}); 
			if (it != st.begin()) {
				--it; 
				if ((*it).se >= l) continue; 
			}
			while (1) {
				auto it = st.upper_bound({r, 0}); 
				if (it == st.end()) break; 
				if ((*it).se <= l) st.erase(it); else break; 
			}
			st.insert({r, l});
			it = st.lower_bound({r, l}); auto nx = st.upper_bound({r, l}); 
			upd(it == st.begin() ? 1 : (*--it).se+1, l, r+1);  
		}
		else {
			cout << getd(l, r) << '\n'; 
		}
	}
	return 0; 
}