#include<stdio.h>
#include<iostream>
#include<string>
using namespace std;
#define MAX 50005
int c[MAX],que[MAX];
int lowbit(int x)
{
	return x&(-x);
}
void create(int n)
{
	for(int i=1;i<=n;i++)
	{
		int s=lowbit(i);
		for(int j=0;j<s;j++)
			c[i]+=que[i-j];
	}
}
int sum(int idx)
{
	int sum=0;
	while(idx>0)
	{
		int s=lowbit(idx);
		sum+=c[idx];
		idx-=s;
	}
	return sum;
}
void change(int i,int n,int x)
{
	while(i<=n)
	{
		int s=lowbit(i);
		c[i]+=x;
		i+=s;
	}
}
int main()
{
	int t,j=1;
	scanf("%d",&t);
	while(t--)
	{
		int N;
		scanf("%d",&N);
		for(int i=1;i<=N;i++)
			scanf("%d",&que[i]);
		memset(c,0,sizeof(c));
		create(N);
		cout<<"Case "<<j++<<":"<<endl;
		while(1)
		{
			char ch[10];
			int i,n,a,b;
			scanf("%s",ch);
			if(!strcmp(ch,"Add"))
			{
				scanf("%d%d",&i,&n);
				change(i,N,n);
			}
			else if(!strcmp(ch,"Sub"))
			{
				scanf("%d%d",&i,&n);
				change(i,N,-n);
			}
			else if(!strcmp(ch,"Query"))
			{
				scanf("%d%d",&a,&b);
				int s=sum(b)-sum(a-1);
				cout<<s<<endl;
			}
			else
				break;
		}
	}
	return 0;
}

int a[maxn],tree[maxn];
int n;
void creat(){
	for(int i=1;i<=n;i++){
		for(int j=0;j<(i&(-i));j++) tree[i]+=a[i-j];
	}
} 
void change(int x,LL val){
    while(x<=n) {
        tree[x]+=val;
        x+=x&(-x);
    }
}
LL sum(int x){
    LL res=0;
    while (x){
        res+=tree[x];
        x-=x&(-x);
    }
    return res;
}