#include<stdio.h>
struct node
{int l;int r;int sum;
}p[1000000];
int ans;
void build_t(int t,int l,int r)
{p[t].r=r;p[t].l=l;p[t].sum=0;if(r==l)return;int temp=2*t;int mid=(l+r)/2;build_t(temp,l,mid);build_t(temp+1,mid+1,r);
}
void add(int t,int l,int k)
{if(p[t].l==p[t].r){p[t].sum+=k;return;}int temp=2*t;int mid=(p[t].l+p[t].r)>>1;if(l<=mid)add(temp,l,k);elseadd(temp+1,l,k);p[t].sum=p[temp].sum+p[temp+1].sum;}
void query(int t,int l,int r)
{if(p[t].r==r&&p[t].l==l){ans+=p[t].sum;return;}int temp=t<<1;int mid=(p[t].r+p[t].l)>>1;if(r<=mid)query(temp,l,r);else if(l>mid)query(temp+1,l,r);else{query(temp,l,mid);query(temp+1,mid+1,r);}}
int main()
{int t,i,x,y,n,cnt=1;char c[10];scanf("%d",&t);while(t--){scanf("%d",&n);build_t(1,1,n);for(i=1;i<=n;i++){scanf("%d",&x);add(1,i,x);}scanf("%s",c);printf("Case %d:\n",cnt++);while(c[0]!='E'){scanf("%d %d",&x,&y);if(c[0]=='Q'){ans=0;query(1,x,y);printf("%d\n",ans);}else  if(c[0]=='A'){add(1,x,y);}else  if(c[0]=='S')add(1,x,-y);scanf("%s",c);}}return 0;
}

#include<stdio.h>
#include<string.h>
int c[200000];
int n;
int lowbit(int x)
{return x&(-x);
}
void  add(int x,int k)
{while(x<=n){c[x]+=k;x=x+lowbit(x);}
}
int Sum(int y)
{int sum=0;while(y>0){sum+=c[y];y=y-lowbit(y);}return sum;
}
int main()
{int i,t,x,y,a,cnt=1;char cc[10];scanf("%d",&t);while(t--){memset(c,0,sizeof(c));scanf("%d",&n);for(i=1;i<=n;i++){scanf("%d",&a);add(i,a);}scanf("%s",cc);printf("Case %d:\n",cnt++);while(cc[0]!='E'){scanf("%d %d",&x,&y);if(cc[0]=='Q')printf("%d\n",Sum(y)-Sum(x-1));else if(cc[0]=='A')add(x,y);elseadd(x,-y);scanf("%s",cc);}}return 0;
}