#include<bits/stdc++.h>
using namespace std;
struct Node
{
	int sum;
	int delta;
	int Left,Right;
	Node *LeftChild,*RightChild;
}*tree=new Node;
void Update(Node *cur)
{
	cur->LeftChild->sum+=cur->delta*(cur->LeftChild->Right-cur->LeftChild->Left);
	cur->RightChild->sum+=cur->delta*(cur->RightChild->Right-cur->RightChild->Left);
	cur->LeftChild->delta+=cur->delta;
	cur->RightChild->delta+=cur->delta;
	cur->delta=0;
}
void Build(Node *cur,int l,int r)
{
	cur->Left=l;
	cur->Right=r;
	cur->sum=0,cur->delta=0;
	if(l+1!=r)
	{
		cur->LeftChild=new Node;
		cur->RightChild=new Node;
		Build(cur->LeftChild,l,(l+r)>>1);
		Build(cur->RightChild,(l+r)>>1,r);
	}
	else cur->LeftChild=cur->RightChild= NULL;
}
void Insert(Node *cur,int x,int delta)
{
	if(cur->Left+1==cur->Right)
		cur->sum+=delta;
	else
	{
		if(x<=((cur->Left+cur->Right)>>1))
			Insert(cur->LeftChild,x,delta);
		if(x>((cur->Left+cur->Right)>>1))
			Insert(cur->RightChild,x,delta);
		cur->sum=cur->LeftChild->sum+cur->RightChild->sum;
	}
}
void Change(Node *cur,int l,int r,int delta)
{
	if(l<=cur->Left&&cur->Right<=r)
	{
		cur->sum+=delta*(cur->Right-cur->Left);
		cur->delta+=delta;
	}
	else
	{
		if(cur->delta!=0)
			Update(cur);
		if(l<((cur->Left+cur->Right)>>1))
			Change(cur->LeftChild,l,r,delta);
		if(r>((cur->Left+cur->Right)>>1))
			Change(cur->RightChild,l,r,delta);
		cur->sum=cur->LeftChild->sum+cur->RightChild->sum;
	}
}
int Search(Node *cur,int l,int r)
{
	if(l<=cur->Left&&cur->Right<=r)
		return cur->sum;
	else
	{
		int ans=0;
		if(cur->delta!=0)
			Update(cur);
		if(l<((cur->Left+cur->Right)>>1))
			ans+=Search(cur->LeftChild,l,r);
		if(r>((cur->Left+cur->Right)>>1))
			ans+=Search(cur->RightChild,l,r);
		return ans;
	}
}
int main()
{
	int n,m;
	cin>>n>>m;
	Build(tree,0,n);
	for(int i=1;i<=n;i++)
	{
		int a;
		cin>>a;
		Insert(tree,i,a);
	}
	for(int i=1;i<=m;i++)
	{
		int a,x,y,k;
		cin>>a;
		if(a==1)
		{
			cin>>x>>y>>k;
			Change(tree,x-1,y,k);
		}
		if(a==2)
		{
			cin>>x>>y;
			cout<<Search(tree,x-1,y)<<endl;
		}
	}
	return 0;
}