#include <bits/stdc++.h>
#define ll long long
#pragma GCC optimeze(2)
using namespace std;
ll ch,s,l,r,n,m,ans,a[1000006];
struct T{
	ll l,r,num=0,tag=0,tagl=-1;
}tr[5000005];

ll build(ll le,ll ri,ll c){
	if(ri-le<0) return 0;
	if(ri-le==0){
		tr[c].num=a[ri];
		tr[c].l=le;
		tr[c].r=ri;
		return tr[c].num;
	}
	tr[c].l=le;
	tr[c].r=ri;
	ll mid=(le+ri)/2;
	tr[c].num+=build(le,mid,2*c);
	tr[c].num+=build(mid+1,ri,2*c+1);
	return tr[c].num;
}

void down(ll c){
	tr[c].num+=tr[c].r-tr[c].l+1*tr[c].tag*(tr[c].l+tr[c].r-2*tr[c].tagl+2)*s*(tr[c].r-tr[c].l+1)/2;
	tr[2*c].tag+=tr[c].tag;
	tr[2*c+1].tag+=tr[c].tag;
	tr[2*c].tagl=tr[c].tagl;
	tr[2*c+1].tagl=tr[c].tagl;
	tr[c].tag=0;
	tr[c].tagl=-1;
	return;
}

void add(ll sle,ll le,ll ri,ll k,ll c){
	down(c);
	if(tr[c].r<le||tr[c].l>ri) return;
	if(tr[c].l>=le&&tr[c].r<=ri){
		tr[c].tag=(tr[c].tag+k);
		tr[c].tagl=sle;
		down(c);
		return;
	}tr[c].num+=(min(ri,tr[c].r)-max(le,tr[c].l)+1)*k;
	long long mid=(le+ri)/2;
	add(sle,le,ri,k,2*c+1);
	add(sle,le,ri,k,2*c);
	
	return;
}

ll find(ll le,ll ri,ll c){
	down(c);
	ll ans=0;
	if(tr[c].l>=le&&tr[c].r<=ri){
		return tr[c].num;
	}if(tr[c].r<le||tr[c].l>ri) return 0;
	ll mid=(le+ri)/2;
	ans+=find(le,ri,2*c+1);
	ans+=find(le,ri,2*c);
	
	
	return ans;
}


int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
    cin>>n>>m;
	if(n<=10000&&m<=10000){
		while(m--){
			cin>>ch;
			if(ch==1){
				cin>>s>>l>>r;
				for(int i=l;i<=r;i++){
					a[i]+=s*(i-l+1);
				}
			}else{
				cin>>l>>r;
				ans=0;
				for(int i=l;i<=r;i++){
					ans+=a[i];
				}
				cout<<ans<<endl;
			}
		}
		return 0;
	}
	
	build(1,n,1);
	
	while(m--){
		for(ll i=1;i<=2*n;i<<=1){
			for(ll j=0;j<i;j++){
				cout<<tr[i+j].num<<" "<<tr[i+j].l<<" "<<tr[i+j].r<<" "<<tr[i+j].tag<<" ";
			}
			cout<<endl;
		}
		cin>>ch;
		if(ch==1){
			cin>>s>>l>>r;
			add(l,l,r,s,(ll)1);
		}else{
			cin>>l>>r;
			cout<<find(l,r,(ll)1)<<endl;
		}
	}
	
    cout<<ans;
    return 0;
}