#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 100005;
ll tree[N*4],tag[N*4];
int n,m,a[N];
void pushup(int rt)
{
	tree[rt] = tree[rt<<1] + tree[rt<<1|1];
}
void pushdown(int l,int r,int rt)
{
	if(tag[rt]){
		tag[rt<<1] += tag[rt];
		tag[rt<<1|1] += tag[rt];
		int mid =(l+r)>>1;
		tree[rt<<1] += tag[rt]*(mid-l+1);
		tree[rt<<1|1] += tag[rt]*(r-mid);
		tag[rt] = 0;
	}
}
void build(int l,int r,int rt)
{
	if(l==r){
		tree[rt] = a[l];
		return;
	}
	int mid = (l+r)>>1;
	build(l,mid,rt<<1);
	build(mid+1,r,rt<<1|1);
	pushup(rt);
}
void update(int l,int r,int rt,int L,int R,int c)
{
	if(L<=l && r<=R){
		tag[rt]+=c;
		tree[rt]+=(r-l+1)*c;
		return;
	}
	pushdown(l,r,rt);
	int mid = (l+r)>>1;
	if(L<=mid)update(l,mid,rt<<1,L,R,c);
	if(R>mid)update(mid+1,r,rt<<1|1,L,R,c);
	pushup(rt);
}
ll query(int l,int r,int rt,int L,int R)
{
	if(L<=l && r<=R){
		return tree[rt];
	}
	pushdown(l,r,rt);
	ll sum = 0;
	int mid = (l+r)>>1;
	if(L<=mid)sum+=query(l,mid,rt<<1,L,R);
	if(R>mid)sum+=query(mid+1,r,rt<<1|1,L,R);
	return sum;
}
int main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)cin>>a[i];
	build(1,n,1);
	while(m--){
		int pos,x,y,z;
		cin>>pos>>x>>y;
		if(pos==1){
			cin>>z;
			update(1,n,1,x,y,z);
		}
		else cout<<query(1,n,1,x,y)<<endl;
	}
	return 0;
}