#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <time.h>
#include <string>
#include <map>
#include <stack>
#include <vector>
#include <set>
#include <queue>
#define maxn (100 + 50)
#define mol 1000000009
#define inf 0x3f3f3f3f
#define Lowbit(x) (x & (-x))
#define M 50005
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
using namespace std;
typedef long long int ll;
int sum[M<<2];
inline void PushPlus(int rt)
{
    sum[rt]=sum[rt*2]+sum[rt*2+1];
}

void  Build(int l,int r,int rt)
{
    if(l==r){
        scanf("%d",&sum[rt]);
        return;
    }
    int m=(l+r)>>1;
    Build(lson);
    Build(rson);
    PushPlus(rt);
    //printf("rt=%d sum[rt]=%d\n",rt,sum[rt]);
}

void Update(int p,int add,int l,int r,int rt)
{
    if(l==r){
        sum[rt]+=add;
        return;
    }
    int m=(r+l)>>1;
    if(p<=m)Update(p,add,lson);
    else Update(p,add,rson);
    PushPlus(rt);
}

int Query(int L,int R,int l,int r,int rt)
{
    if(L<=l&&r<=R)return sum[rt];
    int m=(l+r)>>1;
    int ans=0;
    if(L<=m)ans+=Query(L,R,lson);
    if(R>m)ans+=Query(L,R,rson);
    return ans;
}
int main() {
    int T,n,a,b;
    scanf("%d",&T);
    for(int i=1;i<=T;i++){
        printf("Case %d:\n",i);
        scanf("%d",&n);
        Build(1,n,1);
        char op[10];
        while(~scanf("%s",op)&&op[0]!=‘E‘){
            scanf("%d %d",&a,&b);
            if(op[0]==‘Q‘)printf("%d\n",Query(a,b,1,n,1));
            else if(op[0]==‘S‘)Update(a,-b,1,n,1);
            else Update(a,b,1,n,1);
        }
    }
    return 0;
}