#include<cstdio>

 #include<cctype>

 typedef long long int64;

 inline int getint() {

     register char ch;

     register bool neg=false;

     while(!isdigit(ch=getchar())) if(ch=='-') neg=true;

     register int x=ch^'';

     while(isdigit(ch=getchar())) x=(((x<<)+x)<<)+(ch^'');

     return neg?-x:x;

 }

 inline char getalpha() {

     register char ch;

     while(!isalpha(ch=getchar()));

     return ch;

 }

 const int N=;

 class SplayTree {

     private:

         int par[N],ch[N][],size[N],root;

         int64 val[N],sum[N],tag[N];

         void push_down(const int &p) {

             if(ch[p][]) {

                 tag[ch[p][]]+=tag[p];

                 val[ch[p][]]+=tag[p];

                 sum[ch[p][]]+=tag[p]*size[ch[p][]];

             }

             if(ch[p][]) {

                 tag[ch[p][]]+=tag[p];

                 val[ch[p][]]+=tag[p];

                 sum[ch[p][]]+=tag[p]*size[ch[p][]];

             }

             tag[p]=;

         }

         void push_up(const int &p) {

             size[p]=size[ch[p][]]+size[ch[p][]]+;

             sum[p]=sum[ch[p][]]+sum[ch[p][]]+val[p];

         }

         void rotate(const int &x) {

             const int y=par[x],z=par[y];

             push_down(y),push_down(x);

             const int b=x==ch[y][];

             par[ch[x][b]=par[ch[y][!b]=ch[x][b]]=y]=x;

             par[ch[z][ch[z][]==y]=x]=z;

             push_up(y),push_up(x);

         }

         void splay(int x,const int &goal) {

             for(register int y=par[x],z=par[y];y!=goal;rotate(x),z=par[y=par[x]]) {

                 if(z!=goal) rotate((x==ch[y][])^(y==ch[z][])?x:y);

             }

             if(!goal) root=x;

         }

         int find(int x) {

             for(register int y=root;;y=ch[y][size[ch[y][]]+<x]) {

                 push_down(y);

                 if(par[y]&&y==ch[par[y]][]) x-=size[ch[par[y]][]]+;

                 if(size[ch[y][]]+==x) return y;

             }

         }

     public:

         void build(const int &n) {

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

                 par[ch[i][]=i+]=i;

                 if(i&&i<=n) val[i+]=getint();

             }

             size[n+]=;

             splay(n+,);

         }

         void modify(const int &l,const int &r,const int &x) {

             splay(find(l),);

             splay(find(r+),root);

             tag[ch[ch[root][]][]]+=x;

             val[ch[ch[root][]][]]+=x;

             sum[ch[ch[root][]][]]+=x*size[ch[ch[root][]][]];

         }

         int64 query(const int &l,const int &r) {

             splay(find(l),);

             splay(find(r+),root);

             return sum[ch[ch[root][]][]];

         }

 };

 SplayTree t;

 int main() {

     const int n=getint(),m=getint();

     t.build(n);

     for(register int i=;i<m;i++) {

         const int opt=getalpha(),l=getint(),r=getint();

         if(opt=='C') t.modify(l,r,getint());

         if(opt=='Q') printf("%lld\n",t.query(l,r));

     }

     return ;

 }