#include<bits/stdc++.h>
#define maxn 100005
#define ll long long
using namespace std;
//i<<1|1=i*2+1
//加的运算优先级在C++里比位移的优先级高,所以i<<1+1=i<<(1+1)=i<<2=i*4 
#define leftson i<<1
#define rightson i<<1|1
struct node{
	ll l,r,lazy;//lazy-->懒惰标记，或者延迟标记 
	ll sum;
}tree[maxn<<2];//4倍 
ll a[maxn],n,m;
//建树 
void build(ll i,ll l,ll r){//i=1,l=1,r=n
	tree[i].l=l;
	tree[i].r=r;
	if(l==r){//如果类似（1,1），（2,2）就算叶子结点，如果是叶子节点，就没有子节点，也就直接跳出循环。 
		tree[i].sum=a[l];
		return ;
	}
	ll mid = (l+r)>>1;
	build(leftson,l,mid);//建立左子树 
	build(rightson,mid+1,r);//建立右子树 
	tree[i].sum=tree[leftson].sum+tree[rightson].sum;
	return ;
} 
void pushdown(ll i){//分发任务 
	if(tree[i].lazy!=0){
		tree[leftson].sum+=tree[i].lazy*(tree[leftson].r-tree[leftson].l+1);
		tree[rightson].sum+=tree[i].lazy*(tree[rightson].r-tree[rightson].l+1);
		tree[leftson].lazy+=tree[i].lazy;
		tree[rightson].lazy+=tree[i].lazy;
		tree[i].lazy=0;
	}
	return ;
}
ll ask(ll i,ll x,ll y){
    if(tree[i].l>=x&&tree[i].r<=y){
        return tree[i].sum;
    }
    pushdown(i);
    ll mid=(tree[i].l+tree[i].r)/2;
    ll ans=0;
    if(mid>=x){
        ans+=ask(leftson,x,y);
    }   
    if(mid<y){
        ans+=ask(rightson,x,y);
    }
    return ans; 
} 
void update(ll i,ll x,ll y,ll d){
	if(tree[i].l>=x&&tree[i].r<=y){
		tree[i].sum+=(tree[i].r-tree[i].l+1)*d;
		tree[i].lazy+=d;
		return ;
	}
	pushdown(i);
	ll mid=(tree[i].l+tree[i].r)>>1;
	if(mid>=x){
		update(leftson,x,y,d);//左孩子变化 
	}
	if(mid<y){
		update(rightson,x,y,d);//右孩子变化 
	}
	tree[i].sum=tree[leftson].sum+tree[rightson].sum;//有一个孩子改变就要更新tree[i] 
	return ;
}
int main(){
	scanf("%lld%lld",&n,&m);
	for(ll i=1;i<=n;i++){ 
		scanf("%lld",&a[i]);
	} 
	build(1,1,n);//建立线段数组 ,根节点默认=1 
	for(ll i=1;i<=m;i++){
		ll op,x,y,d;
		scanf("%lld",&op);
		if(op==1){
			scanf("%lld%lld%lld",&x,&y,&d);
			update(1,x,y,d);
		}
		else if(op==2){
			scanf("%lld%lld%lld",&x,&y,&d);
			printf("%lld\n",ask(d,x,y));
		}
		else{
			scanf("%lld%lld",&x,&y);
			printf("%lld\n",ask(1,x,y));
		}
	}
	return 0;
}