/*线段树 250 ms*/

 #include<bits/stdc++.h>

 using namespace std;

 #define M ((L+R)>>1)

 #define lc (id<<1)

 #define rc ((id<<1)|1)

 int sumv[(<<)+];

 void build(int L,int R,int id)

 {

     if(L==R){scanf("%d",&sumv[id]);return;}

     build(L,M,lc);

     build(M+,R,rc);

     sumv[id]=sumv[lc]+sumv[rc];

 }

 void update(int L,int R,int id,int x,int y)

 {

  if(L==R) {sumv[id]=y;return;}

  if(x<=M)update(L,M,lc,x,y);

  else update(M+,R,rc,x,y);

  sumv[id]=sumv[lc]+sumv[rc];

 }

 int ask(int L,int R,int id,int l,int r)

 {

     if(L>=l&&R<=r) {return sumv[id];}

     if(r<=M) return ask(L,M,lc,l,r);

     else if(l>M) return ask(M+,R,rc,l,r);

     else return ask(L,M,lc,l,r)+ask(M+,R,rc,l,r);

 }

 int main()

 {

     int N,i,j,x,y,k=;

     char s[];

     while(cin>>N&&N){

         build(,N,);

         if(k>) puts("");

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

         while(scanf("%s",s)!=EOF){

             if(!strcmp(s,"END")) break;

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

             if(!strcmp(s,"M")) printf("%d\n",ask(,N,,x,y));

             else update(,N,,x,y);

         }

     }

     return ;

 }

 /*树状数组 180ms  */

 #include<bits/stdc++.h>

 using namespace std;

 int sumv[+],n;

 int a[+];

 int lowbit(int x){return x&-x;}

 int sum(int x)

 {

     int ret=;

     while(x>){

         ret+=sumv[x];

         x-=lowbit(x);

     }

     return ret;

 }

 void add(int x,int d)

 {

     while(x<=n){

         sumv[x]+=d;

         x+=lowbit(x);

     }

 }

 int main()

 {

     int k=;

     while(scanf("%d",&n)!=EOF&&n){memset(sumv,,sizeof(sumv));

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

             int x;

             scanf("%d",&x);

             a[i]=x;

             add(i,x);

         }

         char s[];

         if(k>) puts("");

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

         while(scanf("%s",s)!=EOF){

             if(!strcmp(s,"END")) break;

             int x,y;

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

             if(s[]=='M'){

                 printf("%d\n",sum(y)-sum(x-));

             }

             else{

                 add(x,y-a[x]);

                 a[x]=y;

             }

         }

     }

     return ;

 }