#include<cstdio>
#include<cstring>
using namespace std;
#define maxn 50001
int c[maxn];
int a[maxn];
int sum[maxn];
int lowbit(int x)
{
return x&(-x);
}
void add(int x,int val){
while (x<maxn)
{
c[x]+=val;
x+=lowbit(x);
}
}
int getans(int x)
{ int ans=0;
while (x)
{ ans+=c[x];
x-=lowbit(x);
}
return ans;
}
int main()
{ char s[100];int T;int n;
scanf("%d",&T);
for (int kase=1;kase<=T;kase++){
memset(c,0,sizeof(c));
memset(a,0,sizeof(a));
memset(sum,0,sizeof(sum));
scanf("%d",&n);
printf("Case %d:\n",kase);
for (int i=1;i<=n;i++)
scanf("%d",&a[i]);
for (int i=1;i<=n;i++)
sum[i]=sum[i-1]+a[i];
while (~scanf("%s",s)&&strcmp(s,"End")!=0){
int x,y;
scanf("%d%d",&x,&y);
if (s[0]=='Q') {
printf("%d\n",getans(y)-getans(x-1)+sum[y]-sum[x-1]);
}
else {
if (s[0]=='S')
add(x,-y);
else if(s[0]=='A')
add(x,y);
}
}
}
}