#include<cstdio>

 #define lrrt int L,int R,int rt

 #define iall 1,n,1

 #define imid int mid=(L+R)>>1

 #define lson L,mid,rt<<1

 #define rson mid+1,R,rt<<1|1

 const int M=5e4+;

 int a[M];

 char op[];

 int tree[M<<];

 void pushup(int rt){

     tree[rt]=tree[rt<<]+tree[rt<<|];

 }

 void build(lrrt){

     if(L==R){

         tree[rt]=a[L];

         return ;

     }

     imid;

     build(lson);

     build(rson);

     pushup(rt);

 }

 void update(int x,int y,lrrt){

     if(L==R){

         tree[rt]+=y;

         return ;

     }

     imid;

     if(mid>=x) update(x,y,lson);

     else       update(x,y,rson);

     pushup(rt);

 }

 int query(int x,int y,lrrt){

     if(x<=L&&R<=y) return tree[rt];

     imid;

     int ans=;

     if(mid>=x) ans+=query(x,y,lson);

     if(mid<y)  ans+=query(x,y,rson);

     return ans;

 }

 int main(){

     int t,n,x,y;

     while(~scanf("%d",&t)){

         int cas=;

         while(t--){

             scanf("%d",&n);

             for(int i=;i<=n;i++){

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

             }

             build(iall);

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

             while(true){

                 scanf("%s",op);

                 if(op[]=='E') break;

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

                 if(op[]=='Q'){

                     printf("%d\n",query(x,y,iall));

                     continue;

                 }

                 if(op[]=='S') y=-y;

                 update(x,y,iall);

             }

         }

     }

     return ;

 }

 #include<cstdio>

 #include<algorithm>

 #define lrrt int L,int R,int rt

 #define iall 1,n,1

 #define imid int mid=(L+R)>>1

 #define lson L,mid,rt<<1

 #define rson mid+1,R,rt<<1|1

 using namespace std;

 const int M=2e5+;

 int a[M];

 int tree[M<<];

 void pushup(int rt){

     tree[rt]=max(tree[rt<<],tree[rt<<|]);

 }

 void build(lrrt){

     if(L==R){

         tree[rt]=a[L];

         return ;

     }

     imid;

     build(lson);

     build(rson);

     pushup(rt);

 }

 int query(int x,int y,lrrt){

     if(x<=L&&R<=y) return tree[rt];

     imid;

     int ans=;

     if(mid>=x) ans=max(ans,query(x,y,lson));

     if(mid<y)  ans=max(ans,query(x,y,rson));

     return ans;

 }

 void update(int x,int y,lrrt){

     if(L==R){

         tree[rt]=y;

         return ;

     }

     imid;

     if(mid>=x) update(x,y,lson);

     else       update(x,y,rson);

     pushup(rt);

 }

 int main(){

     int n,m,x,y;

     char op[];

     while(~scanf("%d%d",&n,&m)){

         for(int i=;i<=n;i++){

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

         }

         build(iall);

         while(m--){

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

             if(op[]=='Q'){

                 printf("%d\n",query(x,y,iall));

                 continue;

             }

             update(x,y,iall);

         }

     }

     return ;

 }