#include<string>

#include<iostream>

#define lson l,m,rt<<1

#define rson m+1,r,rt<<1|1

using namespace std;

const int maxn = 5e4 + ;

int add[maxn << ];

int tree[maxn << ];

void PushDown(int rt)

{

    if (add[rt]){

        add[rt << ] += add[rt];

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

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

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

        add[rt] = ;

    }

}

void build(int l, int r, int rt)

{

    if (l == r){

        cin >> tree[rt];

        return;

    }

    int m = (l + r) >> ;

    build(lson);

    build(rson);

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

}

void update(int x, int ans, int l, int r, int rt)

{

    if (l == r){

        tree[rt] += ans;

        return;

    }

    int m = (l + r) >> ;

    if (x <= m)update(x, ans, lson);

    else update(x, ans, rson);

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

}

int query(int L, int R, int l, int r, int rt)

{

    if (L <= l&&r <= R){

        return tree[rt];

    }

    int m = (l + r) >> , ans = ;

    if (L <= m)ans += query(L, R, lson);

    if (R > m)ans += query(L, R, rson);

    return ans;

}

int main()

{

    std::ios::sync_with_stdio(false);

    int t, ca = ;

    cin >> t;

    while (t--){

        int n; cin >> n;

        build(, n, );

        string flag; int i, j;

        cout << "Case " << ca++ << ":" << endl;

        while (cin >> flag, flag != "End"){

            cin >> i >> j;

            if (flag == "Add"){

                update(i, j, , n, );

            }

            else if (flag == "Sub"){

                update(i, - * j, , n, );

            }

            else if (flag == "Query"){

                cout << query(i, j, , n, ) << endl;

            }

        }

    }

    return ;

}