#include<iostream>
using namespace std;
const int N=100005;
int n,q,l,r,t;
struct node 
{
    int l,r;
    int sum,add;
}tr[N*4];
void push_up(int u)
{
    tr[u].sum=tr[u*2].sum+tr[u*2+1].sum;
}
void push_down(int u)
{
    if(tr[u].add)
    {
        tr[u*2].sum=(tr[u*2].r-tr[u*2].l+1)*tr[u].add;
        tr[u*2+1].sum=(tr[u*2+1].r-tr[u*2+1].l+1)*tr[u].add;
        tr[u*2].add=tr[u*2+1].add=tr[u].add;
        tr[u].add=0;
    }
}
void build(int u,int l,int r)
{
    tr[u]={l,r,0,0};
    if(l==r)return ;
    int mid=(l+r)/2;
    build(u*2,l,mid);
    build(u*2+1,mid+1,r);
}
void modify(int u,int l,int r)
{
    if(tr[u].l>=l&&tr[u].r<=r)
    {
        tr[u].sum+=(r-l+1);
        tr[u].add=1;
        return ;
    }
    push_down(u);
    int mid=(tr[u].l+tr[u].r)/2;
    if(l<=mid)modify(u*2,l,r);
    if(r>mid)modify(u*2+1,l,r);
    push_up(u);
}
int query(int u,int l,int r)
{
    if(tr[u].l>=l&&tr[u].r<=r)
    {
        return tr[u].sum;
    }
    long long ans=0;
    push_down(u);
    int mid=(tr[u].l+tr[u].r)/2;
    if(l<=mid)ans+=query(u*2,l,mid);
    if(r>mid)ans+=query(u*2+1,mid+1,r);
    return ans;
}
int main()
{
    while(cin>>n>>q)
    {
	    build(1,1,n);
	    while(q--)
	    {
			cin>>t>>l>>r;
	        if(t==1)modify(1,l,r);
	        else cout<<query(1,l,r)<<endl;
	    }
	}
    return 0;
}