#include<cmath>
#include<cstring>
#include<algorithm>
#define rep(i,x,y) for(register int i=x;i<=y;++i)
#define repd(i,x,y) for(register int i=x;i>=y;--i)
#define ll long long 
using namespace std;
const int N=1e7;
ll tr[N<<2],a[N],add[N];
int n,m;

void (int o,int l,int r){
    if(l==r)tr[o]=a[l];
    else {
        int mid=l+r>>1;
        build(o<<1,l,mid);
        build(o<<1|1,mid+1,r);
        tr[o]=tr[o<<1]+tr[o<<1|1];
    }
}

void pushdown(int o,int l,int r){
    if(add[o]){
        add[o<<1]+=add[o];             
        add[o<<1|1]+=add[o];       
        int mid=l+r>>1;
        tr[o<<1]+=add[o]*(mid-l+1);
        tr[o<<1|1]+=add[o]*(r-mid);
        add[o]=0;                   
    }
}

void update(int o,int l,int r,int L,int R,ll k){
    if(L<=l&&R>=r){
        add[o]+=k;
        tr[o]+=k*(r-l+1);
        return ;            //做个标记，不下放
    }
    pushdown(o,l,r);
    int mid=l+r>>1;
    if(L<=mid)update(o<<1,l,mid,L,R,k);
    if(R>mid)update(o<<1|1,mid+1,r,L,R,k);
    tr[o]=tr[o<<1]+tr[o<<1|1];
}

ll ask(int o,int l,int r,int L,int R){
    if(L<=l&&R>=r)return tr[o];
    pushdown(o,l,r);
    int mid=l+r>>1;
    ll ans=0;
    if(L<=mid)ans+=ask(o<<1,l,mid,L,R);
    if(R>=mid+1)ans+=ask(o<<1|1,mid+1,r,L,R);
    return ans;
}

int main(){
    ios::sync_with_stdio(false);
    while(cin>>n>>m){
        rep(i,1,n)cin>>a[i];
        build(1,1,n);
        while(m--){
            char p;
            ll x,y;
            cin>>p>>x>>y;
            if(p=='C'){
                ll k;
                cin>>k;
                update(1,1,n,x,y,k);
            }
            else cout<<ask(1,1,n,x,y)<<endl;
        }
    }
    return 0;
}