rt

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e5+5;
int root[N],tot,a[N];
struct node{int sum,ls,rs,tag;}tr[N<<5];
void pushup(int p,int pl,int pr)
{
	int mid=(pl+pr)>>1;
	tr[p].sum=
	tr[tr[p].ls].sum+(mid-pl+1)*tr[tr[p].ls].tag
	+tr[tr[p].rs].sum+(pr-mid)*tr[tr[p].rs].tag;
}
int build(int pl,int pr)
{
	int p=++tot;
	if(pl==pr)
	{
		tr[p].sum=a[pl];
		return p;
	}
	int mid=(pl+pr)>>1;
	tr[p].ls=build(pl,mid);
	tr[p].rs=build(mid+1,pr);
	pushup(p,pl,pr);
	return p;
}
int update(int p,int pl,int pr,int L,int R,int d)
{
	tr[++tot]=tr[p];
	p=tot;
	if(R<pl||pr<L)
		return p;
	tr[p].sum+=(pr-pl+1)*d;
	if(L<=pl&&pr<=R)
	{
		tr[p].tag+=d;
		return p;
	}
	int mid=(pl+pr)>>1;
	tr[p].ls=update(tr[p].ls,pl,mid,L,R,d);
	tr[p].rs=update(tr[p].rs,mid+1,pr,L,R,d);
	pushup(p,pl,pr);
	return p;
}
int query(int p,int pl,int pr,int L,int R)
{
	if(R<pl||pr<L)
		return 0;
	if(L<=pl&&pr<=R)
		return tr[p].sum+tr[p].tag*(pr-pl+1);
	int mid=(pl+pr)>>1;
	return query(tr[p].ls,pl,mid,L,R)+query(tr[p].rs,mid+1,pr,L,R)+tr[p].tag*(R-L+1);
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n,m,cur=0;
	cin>>n>>m;
	for(int i=1;i<=n;++i)
		cin>>a[i];
	root[0]=build(1,n);
	for(int i=1;i<=m;++i)
	{
		char op;int x,y,k;
		cin>>op>>x;
		if(op=='C')
		{
			cin>>y>>k;
			++cur;
			root[cur]=update(root[cur-1],1,n,x,y,k);
		}
		if(op=='Q')
		{
			cin>>y;
			cout<<query(root[cur],1,n,x,y)<<'\n';
		}
		if(op=='H')
		{
			cin>>y>>k;
			cout<<query(root[k],1,n,x,y)<<'\n';
		}
		if(op=='B')cur=x;
	}
}