#include<cstdio>
using namespace std;
const int M=500005;
int a[M],c[M],c1[M],c2[M];
int n,m,k,x,y,z;
int lowbit(int t)
{
return t&(-t);
}
void update(int l,int r,int val)
{
for(int i=l;i<=n;i+=lowbit(i))
c1[i]+=val;
for(int i=r+1;i<=n;i+=lowbit(i))
c1[i]-=val;
for(int i=l;i<=n;i+=lowbit(i))
c2[i]+=(l-1)*val;
for(int i=r+1;i<=n;i+=lowbit(i))
c2[i]-=r*val;
}
int getsum(int k)
{
int sum=0;
for(int i=k;i>0;i-=lowbit(i))
sum+=k*c1[i];
for(int i=k;i>0;i-=lowbit(i))
sum-=c2[i];
return sum;
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i)
{
scanf("%d",&a[i]);
c[i]=a[i]-a[i-1];
}
for(int i=1;i<=n;++i)
{
for(int j=i-lowbit(i)+1;j<=i;++j)
{
c1[i]+=c[j];
c2[i]+=(j-1)*c[j];
}
}
for(int i=1;i<=m;++i)
{
scanf("%d",&k);
if(k==1)
{
scanf("%d%d%d",&x,&y,&z);
update(x,y,z);
}
else
{
scanf("%d%d",&x,&y);
printf("%d\n",getsum(y)-getsum(x-1));
}
}
}
using namespace std;
const int M=500005;
int a[M],c[M],c1[M],c2[M];
int n,m,k,x,y,z;
int lowbit(int t)
{
return t&(-t);
}
void update(int l,int r,int val)
{
for(int i=l;i<=n;i+=lowbit(i))
c1[i]+=val;
for(int i=r+1;i<=n;i+=lowbit(i))
c1[i]-=val;
for(int i=l;i<=n;i+=lowbit(i))
c2[i]+=(l-1)*val;
for(int i=r+1;i<=n;i+=lowbit(i))
c2[i]-=r*val;
}
int getsum(int k)
{
int sum=0;
for(int i=k;i>0;i-=lowbit(i))
sum+=k*c1[i];
for(int i=k;i>0;i-=lowbit(i))
sum-=c2[i];
return sum;
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i)
{
scanf("%d",&a[i]);
c[i]=a[i]-a[i-1];
}
for(int i=1;i<=n;++i)
{
for(int j=i-lowbit(i)+1;j<=i;++j)
{
c1[i]+=c[j];
c2[i]+=(j-1)*c[j];
}
}
for(int i=1;i<=m;++i)
{
scanf("%d",&k);
if(k==1)
{
scanf("%d%d%d",&x,&y,&z);
update(x,y,z);
}
else
{
scanf("%d%d",&x,&y);
printf("%d\n",getsum(y)-getsum(x-1));
}
}
}