#include<bits/stdc++.h>
#define int long long
using namespace std;
void ts(){cout<<"IAKIOI\n";}
inline int read(){
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
const int mod=998244353;
struct mint{
    int x;mint(int o=0){x=o;}mint&operator+=(mint a){return(x+=a.x)%=mod,*this;}mint&operator-=(mint a){return(x+=mod-a.x)%=mod,*this;}
    mint&operator*=(mint a){return(x=1ll*x*a.x%mod),*this;}mint&operator^=( int b){mint a=*this;x=1;while(b)(b&1)&&(*this*=a,1),a*=a,b>>=1;return*this;}
    mint&operator/=(mint a){return*this*=(a^=mod-2);}friend mint operator+(mint a,mint b){return a+=b;}friend mint operator-(mint a,mint b){return a-=b;}
    friend mint operator*(mint a,mint b){return a*=b;}friend mint operator/(mint a,mint b){return a/=b;}friend mint operator^(mint a,int b){return a^=b;}
    mint operator-(){return 0-*this;}bool operator==(const mint b)const{return x==b.x;}
};
int n,m;
int seg[1000005*4],seg2[1000005*4];
int tag[1000005*4];
void pushdown(int id,int l,int r){
	if(!tag[id])return;
	int mid=(l+r)/2;
	tag[id*2]+=tag[id],tag[id*2+1]+=tag[id];
	seg[id*2]+=(mid-l+1)*tag[id],seg[id*2+1]+=tag[id]*(r-mid);
	seg2[id*2]+=((l+mid)*(mid-l+1)/2)*tag[id];
	seg2[id*2+1]+=((r+mid+1)*(r-mid)/2)*tag[id];
	tag[id]=0;
}
void mdf(int id,int l,int r,int ql,int qr,int d){
	if(l==ql&&r==qr){
		seg[id]+=(r-l+1)*d;
		seg2[id]+=d*((l+r)*(r-l+1)/2);
		tag[id]+=d;
		return;
	}
	pushdown(id,l,r);
	int mid=(l+r)/2;
	if(qr<=mid)mdf(id*2,l,mid,ql,qr,d);
	else if(ql>mid)mdf(id*2+1,mid+1,r,ql,qr,d);
	else mdf(id*2,l,mid,ql,mid,d),mdf(id*2+1,mid+1,r,mid+1,qr,d);
	seg[id]=seg[id*2]+seg[id*2+1];
	seg2[id]=seg2[id*2]+seg2[id*2+1];
}
int qry(int id,int l,int r,int ql,int qr){
	if(l==ql&&r==qr)return seg[id];
	pushdown(id,l,r);
	int mid=(l+r)/2;
	if(qr<=mid)return qry(id*2,l,mid,ql,qr);
	if(ql>mid)return qry(id*2+1,mid+1,r,ql,qr);
	return qry(id*2,l,mid,ql,mid)+qry(id*2+1,mid+1,r,mid+1,qr);
}
int qry2(int id,int l,int r,int ql,int qr){
	if(l==ql&&r==qr)return seg2[id];
	pushdown(id,l,r);
	int mid=(l+r)/2;
	if(qr<=mid)return qry2(id*2,l,mid,ql,qr);
	if(ql>mid)return qry2(id*2+1,mid+1,r,ql,qr);
	return qry2(id*2,l,mid,ql,mid)+qry2(id*2+1,mid+1,r,mid+1,qr);
}
signed main(){
	n=read(),m=read();
	while(m--){
		int ty=read();
		if(ty==2){
			int l=read(),r=read();
			int res=0;
			if(l>1)res+=qry(1,1,n,1,l-1)*(r-l+1);
			if(l<=r)res+=qry(1,1,n,l,r)*(r+1);
			res-=qry2(1,1,n,l,r);
			printf("%lld\n",res);
		}
		else{
			int s=read(),l=read(),r=read();
			mdf(1,1,n,l,r,s);
			if(r<n)mdf(1,1,n,r+1,r+1,-(r-l+1)*s);
		}
	}
	return 0;
}