#include<cstdio>
int n,m;
long long a[1000001];
struct Segment_Tree
{
	int l,r;
	int d;
	int add;
}tree[4000004];
void update(int p)
{
	tree[p].d=tree[p*2].d+tree[p*2+1].d;
}
void build(int p,int l,int r)
{
	tree[p].l=l;
	tree[p].r=r;
	if(l==r)
	{
		tree[p].d=a[l];
		tree[p].add=0;
	}
	else
	{
		int mid=(l+r)/2;
		build(p*2,l,mid);
		build(p*2+1,mid+1,r);
		update(p);
	}
}
void lazy_tag(int p)
{
	Segment_Tree &root=tree[p],&left=tree[p*2],&right=tree[p*2+1];
	if(root.add)
	{
		left.add+=root.add;
		right.add+=root.add;
		left.d+=(long long)(left.r-left.l+1)*root.add;
		right.d+=(long long)(right.r-right.l+1)*root.add;
		root.add=0;
	}
}
void change(int p,int l,int r,int k)
{
	if(tree[p].l>=l&&tree[p].r<=r)
	{
		tree[p].add+=k;
		tree[p].d+=(long long)(tree[p].r-tree[p].l+1)*k;
	 } 
	else
	{
		lazy_tag(p);
		int mid=(tree[p].l+tree[p].r)/2;
		if(l<=mid) change(p*2,l,r,k);
		if(r>mid) change(p*2+1,l,r,k);
		update(p);
	}
}
long long query(int p,int l,int r)
{
	if(tree[p].l>=l&&tree[p].r<=r) return tree[p].d;
	else
	{
		lazy_tag(p);
		int mid=(tree[p].l+tree[p].r)/2;
		long long ans=0;
		if(l<=mid) ans=query(p*2,l,r);
		if(r>mid) ans+=query(p*2+1,l,r);
		return ans;
	}
}
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
	build(1,1,n);
	while(m--)
	{
		int op,x,y,k;
		scanf("%d%d%d",&op,&x,&y);
		if(op==1)
		{
			scanf("%d",&k);
			change(1,x,y,k);
		}
		else printf("%lld\n",query(1,x,y));
	}
	return 0;
}