#include<cstdio>

 #include<map>

 //#include<bits/stdc++.h>

 #include<vector>

 #include<stack>

 #include<iostream>

 #include<algorithm>

 #include<cstring>

 #include<cmath>

 #include<queue>

 #include<cstdlib>

 #include<climits>

 #define INF 0x3f3f3f3f

 using namespace std;

 typedef long long ll;

 typedef __int64 int64;

 const ll mood=1e9+;

 const int64 Mod=;

 const double eps=1e-;

 const int MAXN=;

 const double PI=acos(-1.0);

 inline void rl(ll&num){

     num=;ll f=;char ch=getchar();

     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

     while(ch>=''&&ch<='')num=num*+ch-'',ch=getchar();

     num*=f;

 }

 inline void ri(int &num){

     num=;int f=;char ch=getchar();

     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

     while(ch>=''&&ch<='')num=num*+ch-'',ch=getchar();

     num*=f;

 }

 int getnum()//相邻的个位整数输入 如想分别保存1234 输入连续的1234 a[i]=getnum();就可以实现

 {

     char ch=getchar();

     while((ch<'' || ch>'') && ch!='-')

         ch=getchar();

     return (ch-'');

 }

 inline void out(int x){ if(x<) {putchar('-');  x*=-;}if(x>) out(x/);    putchar(x%+''); }

 ll sum[MAXN<<],add[MAXN<<];

 int n;

 void init(int _n)

 {

     n=;

     while(n<_n) n*=;

     for(int i=;i<*n-;i++)

     {

         sum[i]=add[i]=;

     }

 }

 void pushdown(int rt,int m)

 {

     if(add[rt])

     {

         add[rt*+] += add[rt];

         add[rt<<|] += add[rt];

         sum[rt*+] += add[rt] * (m - (m>>));

         sum[rt<<|] += add[rt] * (m>>);

         add[rt] = ;

     }

 }

 void pushup(int rt)

 {

     sum[rt]=sum[rt*+]+sum[rt<<|];

 }

 void update(int a,int b,int c,int k,int l,int r)

 {

     if(r<=a||b<=l) return ;

     if(a<=l&&r<=b)

     {

         add[k]+=c;

         sum[k]+=(ll)c*(r-l);

         return ;

     }

     if(l+==r) return;

     pushdown(k,r-l);

     int m=(l+r)/;

     if(b<=m)

     {

         update(a,b,c,k*+,l,m);

     }

     else{

         if(l>m)update(a,b,c,k*+,m,r);

         else{

             update(a,b,c,k*+,l,m);

             update(a,b,c,k*+,m,r);

         }

     }

     pushup(k);

 }

 ll query(int a,int b,int k,int l,int r)

 {

     if(r<=a||b<=l) return ;

     if(a<=l&&r<=b)

     {

         return sum[k];

     }

     pushdown(k,r-l);

     int m=(l+r)/;

     ll res=;

     if(b<=m)

     {

         res+=query(a,b,k*+,l,m);

     }

     else{

         if(l>m)res+=query(a,b,k*+,m,r);

         else{

             res+=query(a,b,k*+,l,m);

             res+=query(a,b,k*+,m,r);

         }

     }

     return res;

 }

 void ad(int k,int a)

 {

     k+=n-;

     sum[k]=a;

     while(k>)

     {

         k=(k-)/;

         sum[k]=sum[k*+]+sum[k*+];

     }

 }

 int main()

 {

     int _n,m;

     while(scanf("%d%d",&_n,&m)==)

     {

         init(_n);

         for(int i=;i<=_n;i++)

         {

             int tem;

             ri(tem);ad(i,tem);

         }

         char ch[];

         int a,b,c;

         while(m--)

         {

             scanf("%s",ch);

             if(ch[] == 'Q')

             {

                 scanf("%d %d", &a,&b);

                 printf("%lld\n",query(a,b+,,,n));

             }

             else

             {

                 scanf("%d %d %d",&a,&b,&c);

                 update(a,b+,c,,,n);

             }

         }

         memset(add,,sizeof(add));

         memset(sum,,sizeof(sum));

     }

     return ;

 }