#include<cstdio>

#include<cmath>

#include<cstring>

#include<algorithm>

using namespace std;

const int N=;

typedef long long ll;

struct aa

{

    int lc,rc,l,r;

    ll add,sum;

    int len(){return r-l+;}

}a[N*];

int n,m,rt[N],time,tot,Time[N];

void build(int &u,int l,int r)

{

    u=++tot;

    a[u].l=l,a[u].r=r;

    if (l==r) {scanf("%lld",&a[u].sum);return;}

    int mid=(l+r)>>;

    build(a[u].lc,l,mid);

    build(a[u].rc,mid+,r);

    a[u].sum=a[a[u].lc].sum+a[a[u].rc].sum;

}

void insert(int &now,int old,int l,int r,ll d)

{

    now=++tot;

    a[now]=a[old];

    if (a[old].l==l&&a[old].r==r)

    {

        a[now].add+=d;

        return;

    }

    a[now].sum+=d*(r-l+);

    int mid=(a[now].l+a[now].r)>>;

    if (r<=mid) insert(a[now].lc,a[old].lc,l,r,d);

    else if (mid<l) insert(a[now].rc,a[old].rc,l,r,d);

    else

    {

        insert(a[now].lc,a[old].lc,l,mid,d);

        insert(a[now].rc,a[old].rc,mid+,r,d);

    }

}

ll query(int u,int l,int r)

{

    ll tmp=a[u].add*(r-l+);

    if (a[u].l==l&&a[u].r==r) return a[u].sum+tmp;

    int mid=(a[u].l+a[u].r)>>;

    if (r<=mid) return tmp+query(a[u].lc,l,r);

    else if (mid<l) return tmp+query(a[u].rc,l,r);

    return tmp+query(a[u].lc,l,mid)+query(a[u].rc,mid+,r);

}

int main()

{

    scanf("%d%d",&n,&m);

    build(rt[],,n);

    time=;

    char ch[];

    int x,y,t;ll d;

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

     {

        scanf("%s",ch);

        if (ch[]=='C')

         {

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

            time++;

            insert(rt[time],rt[time-],x,y,d);

            Time[time]=tot;

         }

        if (ch[]=='Q')

         {

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

             printf("%lld\n",query(rt[time],x,y));

         }

        if (ch[]=='H')

         {

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

            printf("%lld\n",query(rt[t],x,y));

         }

        if (ch[]=='B')

         {

             scanf("%d",&time);

            tot=Time[time];

         }

     }

    return ;

}