#include <iostream>
#include <cstring>
#include <algorithm>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long LL;
const int N = 2e5 + 10;
struct Node{
int l, r, v;
}tr[N << 2];
int n, m;
void pu(int u){
tr[u].v = max(tr[u << 1].v, tr[u << 1 | 1].v);
}
void build(int u, int l, int r){
tr[u] = {l, r, 0};
if (l == r) return;
int mid = l + r >> 1;
build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
pu(u);
}
void update(int u, int i, int z){
if (tr[u].l == tr[u].r && tr[u].l == i){
tr[u].v = z;
return;
}
int mid = tr[u].l + tr[u].r >> 1;
if (i <= mid) update(u << 1, i, z);
else update(u << 1 | 1, i, z);
pu(u);
}
int query(int u, int l, int r){
if (tr[u].l >= l && tr[u].r <= r)
return tr[u].v;
int mid = tr[u].l + tr[u].r >> 1;
int Max = -INF;
if (l <= mid)
Max = max(Max, query(u << 1, l, r));
if (r > mid)
Max = max(Max, query(u << 1 | 1, l, r));
return Max;
}
int main(){
while (~scanf("%d%d", &n, &m)){
build(1, 1, 200000);
for (int i = 1; i <= n; i ++ ){
int x;
scanf("%d", &x);
update(1, i, x);
}
while (m -- ){
char op[2];
int a, b;
scanf("%s%d%d", op, &a, &b);
if (op[0] == 'Q')
printf("%d\n", query(1, a, b));
else
update(1, a, b);
}
}
return 0;
}
#include <iostream>
#include <cstring>
#include <algorithm>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long LL;
const int N = 50010;
struct Node{
int l, r, v;
}tr[N << 2];
int n, casei;
void pu(int u){
tr[u].v = tr[u << 1].v + tr[u << 1 | 1].v;
}
void build(int u, int l, int r){
tr[u] = {l, r, 0};
if (l == r) return;
int mid = l + r >> 1;
build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
pu(u);
}
void update(int u, int i, int z){
if (tr[u].l == tr[u].r && tr[u].l == i){
tr[u].v += z;
return;
}
int mid = tr[u].l + tr[u].r >> 1;
if (i <= mid) update(u << 1, i, z);
else update(u << 1 | 1, i, z);
pu(u);
}
int query(int u, int l, int r){
if (tr[u].l >= l && tr[u].r <= r)
return tr[u].v;
int mid = tr[u].l + tr[u].r >> 1;
int res = 0;
if (l <= mid) res += query(u << 1, l, r);
if (r > mid) res += query(u << 1 | 1, l, r);
return res;
}
int main(){
int T;
cin >> T;
while (T -- ){
scanf("%d", &n);
printf("Case %d:\n", ++ casei);
build(1, 1, 50000);
for (int i = 1; i <= n; i ++ ){
int x;
scanf("%d", &x);
update(1, i, x);
}
char op[10];
int a, b;
while (~scanf("%s", op)){
if (op[0] == 'E') break;
else if (op[0] == 'A'){
scanf("%d%d", &a, &b);
update(1, a, b);
}else if (op[0] == 'S'){
scanf("%d%d", &a, &b);
update(1, a, -b);
}else if (op[0] == 'Q'){
scanf("%d%d", &a, &b);
printf("%d\n", query(1, a, b));
}
}
}
return 0;
}
#include <iostream>
#include <cstring>
#include <algorithm>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long LL;
const int N = 50010;
struct Node{
int l, r, mx, mn;
}tr[N << 2];
int n, m;
void pu(int u){
tr[u].mx = max(tr[u << 1].mx, tr[u << 1 | 1].mx);
tr[u].mn = min(tr[u << 1].mn, tr[u << 1 | 1].mn);
}
void build(int u, int l, int r){
tr[u].l = l, tr[u].r = r, tr[u].mx = 0, tr[u].mn = INF;
if (l == r) return;
int mid = l + r >> 1;
build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
pu(u);
}
void update(int u, int i, int z){
if (tr[u].l == tr[u].r && tr[u].l == i){
tr[u].mx = z;
tr[u].mn = z;
return;
}
int mid = tr[u].l + tr[u].r >> 1;
if (i <= mid) update(u << 1, i, z);
else update(u << 1 | 1, i, z);
pu(u);
}
int query_max(int u, int l, int r){
if (tr[u].l >= l && tr[u].r <= r)
return tr[u].mx;
int mid = tr[u].l + tr[u].r >> 1;
int Max = -INF;
if (l <= mid)
Max = max(Max, query_max(u << 1, l, r));
if (r > mid)
Max = max(Max, query_max(u << 1 | 1, l, r));
return Max;
}
int query_min(int u, int l, int r){
if (tr[u].l >= l && tr[u].r <= r)
return tr[u].mn;
int mid = tr[u].l + tr[u].r >> 1;
int Min = INF;
if (l <= mid)
Min = min(Min, query_min(u << 1, l, r));
if (r > mid)
Min = min(Min, query_min(u << 1 | 1, l, r));
return Min;
}
int main(){
scanf("%d%d", &n, &m);
build(1, 1, 50000);
for (int i = 1; i <= n; i ++ ){
int x;
scanf("%d", &x);
update(1, i, x);
}
while (m -- ){
int a, b;
scanf("%d%d", &a, &b);
printf("%d\n", query_max(1, a, b) - query_min(1, a, b));
}
return 0;
}