/*
MiYu原創(chuàng), 轉帖請注明 : 轉載自 ______________白白の屋
http://www.cnblog.com/MiYu
Author By : MiYu
Test : 3
Program : 1166
*/
#include <iostream>
#include <algorithm>
using namespace std;
typedef struct Line{ //線段樹結構體
friend struct optLine;
Line () { sum = 0; left = right = NULL; };
int l,r,sum;
struct Line *left, *right;
}L;
typedef struct optLine { //線段樹操作結構
void Creat ( struct Line *node, int beg, int end );
void modify ( struct Line *node, int pos,int val );
int quy ( struct Line *node, int beg, int end );
}OPT;
void optLine::Creat ( struct Line *node, int beg, int end ){ //建樹
node->l = beg; node->r = end;
if ( beg == end ) return;
int mid = ( node->l + node->r ) >> 1;
L *p = new L; L *q = new L;
node->left = p; node->right = q;
Creat ( p, beg, mid ); Creat ( q, mid + 1, end );
}
void optLine::modify ( struct Line *node, int pos, int val ){ //修改
if ( pos >= node->l && pos <= node->r ) node->sum += val;
if ( node->l == node->r ) return;
int mid = ( node->l + node->r ) >> 1;
if ( mid >= pos ) modify ( node->left, pos, val );
else if ( mid < pos ) modify ( node->right, pos,val );
}
int optLine::quy ( struct Line *node, int beg, int end ){ //查詢
int sum = 0; int mid = ( node->l + node->r ) >> 1;
if ( node->l == beg && node->r == end ) return node->sum;
if ( mid >= end ) return sum += quy ( node->left, beg,end );
else if ( beg > mid ) return sum += quy ( node->right, beg, end );
else {
return sum += quy ( node->left, beg, mid ) + quy ( node->right, mid+1,end );
}
}
inline bool scan_ud(int &num)
{
char in;
in=getchar();
if(in==EOF) return false;
while(in<'0'||in>'9') in=getchar();
num=in-'0';
while(in=getchar(),in>='0'&&in<='9'){
num*=10,num+=in-'0';
}
return true;
}
int main ( int T, int N )
{
scan_ud ( T );
for ( int ca = 1; ca <= T ; ++ ca ){
printf ( "Case %d:\n",ca );
scan_ud ( N ); OPT opt; L *root = new L; int val,x,y;
opt.Creat ( root, 1, N );
for ( int i = 1; i <= N; ++ i ){
scan_ud ( val ); opt.modify ( root, i, val );
}
char ask[10];
while ( scanf ( "%s", ask ), ask[0] != 'E' ){
scanf ( "%d%d",&x,&y );
switch ( ask[0] ){
case 'Q': printf ( "%d\n",opt.quy ( root, x,y ) ); break;
case 'A': opt.modify ( root, x, y ); break;
case 'S': opt.modify ( root, x, -y ); break;
}
}
}
return 0;
}