#include<iostream>
using namespace std;
#define N 100005
typedef __int64 ss;
struct
{int l,r;ss sum,add;
}tree[N*4];
ss a[N];
void creat(int i,int l,int r)
{int mid=(l+r)/2;tree[i].l=l;tree[i].r=r;tree[i].sum=tree[i].add=0;if(l==r){tree[i].sum=a[l];return ;}creat(i*2,l,mid);creat(i*2+1,mid+1,r);tree[i].sum=tree[i*2].sum+tree[i*2+1].sum;
}
void updata(int i,int l,int r,int c)
{if(l<=tree[i].l&&tree[i].r<=r){tree[i].add+=c;tree[i].sum+=c*(tree[i].r-tree[i].l+1);return;}if(tree[i].add!=0){tree[i*2].add+=tree[i].add;tree[i*2+1].add+=tree[i].add;tree[i*2].sum+=tree[i].add*(tree[i*2].r-tree[i*2].l+1);tree[i*2+1].sum+=tree[i].add*(tree[i*2+1].r-tree[i*2+1].l+1);tree[i].add=0;}int mid=(tree[i].l+tree[i].r)/2;if(mid>=l)updata(i*2,l,r,c);if(mid<r)updata(i*2+1,l,r,c);tree[i].sum=tree[i*2].sum+tree[i*2+1].sum;
}
ss getsum(int i,int l,int r)
{if(tree[i].l>=l&&tree[i].r<=r){return tree[i].sum;}if(tree[i].add!=0){tree[i*2].add+=tree[i].add;tree[i*2+1].add+=tree[i].add;tree[i*2].sum+=tree[i].add*(tree[i*2].r-tree[i*2].l+1);tree[i*2+1].sum+=tree[i].add*(tree[i*2+1].r-tree[i*2+1].l+1);tree[i].add=0;}int mid=(tree[i].l+tree[i].r)/2;ss sum1=0,sum2=0;if(mid>=l)sum1=getsum(i*2,l,r);if(mid<r)sum2=getsum(i*2+1,l,r);return sum1+sum2;
}
int main()
{int n,q;while(scanf("%d %d",&n,&q)>0){int i;for(i=1;i<=n;i++)scanf("%I64d",&a[i]);creat(1,1,n);while(q--){char t[10];scanf("%s",t);if(t[0]=='Q'){int l,r;scanf("%d%d",&l,&r);printf("%I64d\n",getsum(1,l,r));}else{int l,r,c;scanf("%d%d%d",&l,&r,&c);updata(1,l,r,c);}}}return 0;
}