#include<stdio.h>

 #include<algorithm>

 #include<stdlib.h>

 #include<string.h>

 using namespace std;

 #define Lson r<<1

 #define Rson r<<1|1

 const int N = 1e6+;

 struct SegmentTree

 {

     int L, R;

     int sum, e;

     int Mid()

     {

         return (R+L)>>;

     }

 }a[N<<];

 void BuildSegTree(int r, int L, int R)

 {

     a[r].L=L, a[r].R=R;

     a[r].e=;

     if(L==R)

     {

         scanf("%d", &a[r].sum);

         return ;

     }

     BuildSegTree(Lson, L, a[r].Mid());

     BuildSegTree(Rson, a[r].Mid()+, R);

     a[r].sum = a[Lson].sum + a[Rson].sum;

 }

 void Update(int r, int L, int R, int i, int e)

 {

     a[r].sum += e;

     if(L==R && L==i)

         return ;

     if(i<=a[r].Mid())

         Update(Lson, L, a[r].Mid(), i, e);

     else if(i>a[r].Mid())

         Update(Rson, a[r].Mid()+, R, i, e);

 }

 int Query(int r, int L, int R)

 {

     if(a[r].L==L && a[r].R==R)

         return a[r].sum;

     if(R<=a[r].Mid())

        return  Query(Lson, L, R);

     else if(L>a[r].Mid())

        return Query(Rson, L, R);

     else

     {

         long long Lsum = Query(Lson, L, a[r].Mid());

         long long Rsum = Query(Rson, a[r].Mid()+, R);

         return Lsum + Rsum;

     }

 }

 int main()

 {

   int t, k=;

   scanf("%d", &t);

   while(t--)

   {

       int n;

       scanf("%d", &n);

       BuildSegTree(, , n);

       char s[];

       int L, R, i, e;

       printf("Case %d:\n", k++);

       while(scanf("%s", s), strcmp(s, "End"))

       {

           if(strcmp(s, "Query")==)

           {

               scanf("%d%d", &L, &R);

               printf("%d\n", Query(, L, R));

           }

           else if(strcmp(s, "Add")==)

           {

               scanf("%d%d", &i, &e);

               Update(, , n, i, e);

           }

           else

           {

               scanf("%d%d", &i, &e);

               Update(, , n, i, -e);

           }

       }

   }

    return ;

 }

 #include<stdio.h>

 #include<math.h>

 #include<string.h>

 #define maxn 50005

 struct node

 {

     int L, R, sum;//左右子树,sum记录区间和

     int Mid(){return (L+R)/;}

 }tree[maxn*];//为了保险起见一般定义是四倍

 int val[maxn];//保存每个阵地原来的人数

 void Build(int root, int L, int R)//建树

 {

     tree[root].L = L, tree[root].R = R;

     if(L == R)

     {

         tree[root].sum = val[L];

         return ;

     }

     Build(root<<, L, tree[root].Mid());//<<1 运算符相当于乘上 2，因为是数往左移一位

     Build(root<<|, tree[root].Mid()+, R);//|1， 因为左移后最后一位是0， 所以与1进行|相当于+1

     tree[root].sum = tree[root<<].sum+tree[root<<|].sum;//区间和等于左右区间的和

 }

 //k表示需要更新的点，e表示需要更新的值

 void Insert(int root, int k, int e)

 {

     tree[root].sum += e;

     if(tree[root].L == tree[root].R)

         return ;

     if(k <= tree[root].Mid())

         Insert(root<<, k, e);

     else

         Insert(root<<|, k, e);

 }

 //查询区间LR的和

 int Query(int root, int L, int R)

 {

     if(tree[root].L == L && tree[root].R == R)

         return tree[root].sum;

     //如果在左子树区间

     if(R <= tree[root].Mid())

         return Query(root<<, L, R);

     else if(L > tree[root].Mid())//如果在右子树区间

         return Query(root<<|, L, R);

     else

     {//在左右子树

         int Lsum = Query(root<<, L, tree[root].Mid());

         int Rsum = Query(root<<|, tree[root].Mid()+, R);

         return Lsum + Rsum;

     }

 }

 int main()

 {

     int T, t=;

     scanf("%d", &T);

     while(T--)

     {

         int i, N, x, y;

         scanf("%d", &N);

         for(i=; i<=N; i++)

             scanf("%d", &val[i]);

         Build(, , N);

         char s[];

         printf("Case %d:\n", t++);

         while(scanf("%s", s), s[] != 'E')

         {

             scanf("%d%d", &x, &y);

             if(s[] == 'A')

                 Insert(, x, y);

             else if(s[] == 'S')

                 Insert(, x, -y);

             else

             {

                 int ans = Query(, x, y);

                 printf("%d\n", ans);

             }

         }

     }

     return ;

 }