//一样的代码G++过不了
//请使用C++11
//原因未知
#include<iostream>
#include<stdio.h>
using namespace std;
typedef long long ll;
const int maxn = 100005;

class Node{
public:
    int l, r;
    ll sum, lazy;
    int len(){return r - l + 1;}
    void update(int val){
        lazy+=val;
        sum += 1LL * len() * val;
    }
};
Node tr[maxn * 4];
int a[maxn];


void pushup(int id) {
    tr[id].sum = tr[id << 1].sum + tr[id << 1 | 1].sum;
}
void pushdown(int id) {
    ll lazy = tr[id].lazy;
    if(lazy == 0) return;
    tr[id << 1].update(lazy);
    tr[id << 1 | 1].update(lazy);
    tr[id].lazy = 0;
}
void build(int id, int l, int r){
    tr[id].l = l;tr[id].r = r;
    tr[id].lazy = tr[id].sum = 0;
    if(l == r){
        tr[id].sum = a[l];
        return;
    }
    int mid = (l + r) >> 1;
    build(id << 1, l, mid);
    build(id << 1 | 1, mid + 1, r);
    pushup(id);
}
void update(int id, int l, int r ,int val) {
    if(tr[id].l == l && tr[id].r == r){
        tr[id].update(val);
        return;
    }
    pushdown(id);
    int mid = (tr[id].l + tr[id].r) >> 1;
    if(r <= mid) update(id << 1, l, r, val);
    else if(l > mid) update(id << 1 | 1, l, r, val);
    else {
        update(id << 1, l, mid, val);
        update(id << 1 | 1, mid + 1, r, val);
    }
    pushup(id);
}
ll query(int id, int l, int r) {
    if(tr[id].l == l && tr[id].r == r) {
        return tr[id].sum;
    }
    pushdown(id);
    int mid = (tr[id].l + tr[id].r) >> 1;
    if(r <= mid) return query(id<<1, l, r);
    else if(l > mid) return query(id << 1 | 1, l, r);
    else return query(id << 1, l, mid) + query(id << 1 | 1, mid + 1, r);
}

int main(){
    int n, q;
    char op[10];
    scanf("%d%d", &n, &q);
    for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
    build(1, 1, n);
    for(int i = 1; i <= q; i++){
        scanf("%s", op);
        if(op[0] == 'Q'){
            int l, r;
            scanf("%d%d", &l, &r);
            printf("%lld\n", query(1, l, r));
        }else{
            int l, r, val;
            scanf("%d %d %d", &l, &r, &val);
            update(1, l, r, val);
        }
    }

    return 0;
}

//presented by 大吉大利，今晚AC