#include <cstdio>

 #include <cstring>

 using namespace std;

 const int maxn =  + ;

 struct{

     long long val, addMark;

 }segTree[maxn << ];

 long long a[maxn];

 int n , m;

 void build(int root, int l, int r){

     segTree[root].addMark = ;

     if(l == r){

         segTree[root].val = a[l];

         return;//记得return

     }

     int mid = (l+r) >> ;

     build(root*, l,mid);

     build(root*+, mid + , r);

     segTree[root].val = segTree[root*].val + segTree[root*+].val; //回溯时候更新root

 }

 void push_down(int root,int L, int R){//传入L， R是为了计算左右子树的和， 分别是(mid - L + 1)、(R-mid)

     if(segTree[root].addMark != ){

         int mid = L + R >> ;

         segTree[root*].addMark += segTree[root].addMark;

         segTree[root*+].addMark += segTree[root].addMark;

         segTree[root*].val += segTree[root].addMark * (mid - L + );

         segTree[root*+].val += segTree[root].addMark * (R-mid);

         segTree[root].addMark = ;

     }

 }

 long long query(int root, int L, int R, int QL, int QR){

     if(L > QR || R < QL) return ;

     if(QL <= L && QR >= R) {

         return segTree[root].val;

     }

     push_down(root,L,R);//如果要向下计算记得先pushdown

     int mid = L + R >> ;

     return query(root*,L,mid,QL,QR) + query(root*+,mid+,R,QL,QR);

 }

 void update(int root, int L ,int R, int QL, int QR, int val){

     if(L > QR || R < QL) return;

     if(QL <= L && QR >= R){

         segTree[root].val += val * (R-L+);

         segTree[root].addMark += val;

         return;

     }

     push_down(root,L,R);//如果要向下计算记得先pushdown

     int mid = L + R >> ;

     update(root*, L, mid, QL , QR , val);

     update(root*+,mid+, R, QL,QR,val);

     segTree[root].val = segTree[root*].val + segTree[root*+].val;//回溯更新root

 }

 int main()

 {

 //    freopen("1.txt","r", stdin);

     while(~scanf("%d %d", &n , &m)){

     memset(segTree,,sizeof(segTree));

     for(int i = ; i <= n; i++){

         scanf("%lld", &a[i]);

     }

     build(,,n);

     while(m--){

         char cho[];

         scanf("%s", cho);

         int x, y;

         scanf("%d %d", &x, &y);

         if(cho[] == 'C'){

             int v;

             scanf("%d", &v);

             update(,,n,x,y,v);

         }

         else{

             printf("%lld\n",query(,,n,x,y));

         }

     }

     }

 }