#include<iostream>
#include<algorithm>
#include<math.h>
#include<map>
#include<string.h>
#include<queue>
#define int long long
#define endl "\n";
using namespace std;
struct cmp{
	int l,r,sum;
	int lazy;
}tr[2000005];
void push_down(int i)
{
	if(tr[i].lazy)
	{
		tr[i*2].sum+=tr[i].lazy;
		tr[i*2+1].sum+=tr[i].lazy;
		tr[i*2].lazy+=tr[i].lazy;
		tr[i*2+1].lazy+=tr[i].lazy;
		tr[i].lazy=0;
	}
}
void init(int i,int l,int r)
{
//	cout<<l<<" "<<r<<endl;
	tr[i].sum=0;
	tr[i].l=l;
	tr[i].r=r;
	tr[i].lazy=0;
	if(l==r) return ;
	int mid=(l+r)/2;
	init(i*2,l,mid);
	init(i*2+1,mid+1,r);
}
void add(int l,int r,int i)
{
	if(l<=tr[i].l&&tr[i].r<=r)
	{
		tr[i].sum+=1;
		tr[i].lazy+=1; 
		return ;
	}
	push_down(i);
	if(tr[i*2].r>=l) add(l,r,i*2);
	if(tr[i*2+1].l<=r) add(l,r,i*2+1);
	tr[i].sum=tr[i*2].sum+tr[i*2+1].sum;
	return ;
}
int ask(int i,int l,int r)
{
	if(tr[i].l<=l&&tr[i].r>=r)
	{
//		cout<<tr[i].l<<" "<<tr[i].r<<endl; 
		return tr[i].sum;
	}
	if(tr[i].l>=l||tr[i].r<=r) return 0;
	int s=0;
	push_down(i);
	if(tr[i*2].r>=l) s+=ask(i*2,l,r);
	if(tr[i*2+1].l<=r) s+=ask(i*2+1,l,r);
	return s;
}
signed main()
{
//	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int n,q;
	while(scanf("%lld%lld",&n,&q)!=EOF)
	{
			init(1,1,n);
			while(q--)
			{
				int a,x,y;
				cin>>a>>x>>y;
				if(x>y) swap(x,y);
				if(a==1)
				{
					add(x,y,1);
				}
				else
				{
					cout<<ask(1,x,y)<<endl;
				}
			}
	}
	return 0;
}