#include<bits/stdc++.h>
#define int long long
using namespace std;
struct cmp{
	int l,r;
	int sum;
	int lazy;
}tr[2000005];
void push_down(int i)
{
	if(tr[i].lazy!=0)
	{
		tr[2*i].lazy+=tr[i].lazy;
		tr[i*2+1].lazy+=tr[i].lazy;
		int mid=(tr[i].l+tr[i].r)/2;
		tr[i*2].sum+=tr[i].lazy*(mid-tr[i*2].l+1);
		tr[i*2+1].sum+=tr[i].lazy*(tr[i*2+1].r-mid);
		tr[i].lazy=0;
	}
	return ;
}
void init(int i,int l,int r)
{
	tr[i].lazy=0;
	tr[i].l=l,tr[i].r=r;
	if(l==r)
	{
		tr[i].sum=0;
		return ;
	}
	int mid=(l+r)/2;
	init(i*2,l,mid);
	init(i*2+1,mid+1,r);
	tr[i].sum=tr[i*2].sum+tr[i*2+1].sum;
}
void add(int i,int l,int r)
{
	if(tr[i].r<=r&&tr[i].l>=l)
	{
		tr[i].sum+=1;
		tr[i].lazy+=1;
		return ;
	}
	push_down(i);
	if(tr[i*2].r>=l) add(i*2,l,r);
	if(tr[i*2+1].l<=r) add(i*2+1,l,r);
	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,m;
	while(scanf("%lld%lld",&n,&m)!=EOF)
	{
		init(1,1,n);
		while(m--)
		{
			int p;
			cin>>p;
			if(p==1)
			{
				int x,y;
				cin>>x>>y;
				add(1,x,y);
			}
			else
			{
				int x,y;
				cin>>x>>y;
				cout<<ask(1,x,y)<<"\n";
			}
		}
	}
}