int main() {
int n, q;
scanf("%d%d", &n, &q);
memset(&tree, 0, sizeof(tree));
for(int i = 1; i <= n; i++)
scanf("%d", &A[i]);
tree.build(1, 1, n);
int k, args[20], original[20];
char cmd[100];
while(q--) {
scanf("%s", cmd);
// 解析输入
int len = strlen(cmd);
k = 0; args[k] = 0;
for(int i = 6; i < len; i++)
if(isdigit(cmd[i])) args[k] = args[k] * 10 + cmd[i] - '0';
else { k++; args[k] = 0; }
// 处理命令
if(cmd[0] == 'q') {
qL = args[0]; qR = args[1];
printf("%d\n", tree.query(1, 1, n));
} else {
for(int i = 0; i < k; i++) original[i] = A[args[i]];
for(int i = 0; i < k; i++) {
p = args[i];
v = A[p] = original[(i+1)%k];
tree.update(1, 1, n);
}
}
}
return 0;
}
void solve()
{
int n = readint();
tree1.init(MAXC);
tree2.init(MAXC);
int i = 0;
for(i = 0; i < n; i++)
{
City *p = &(cities[i]);
readint();
p->y = readint();
p->ppa = p;
p->minY = p->y;
p->maxY = p->y;
p->size = 1;
}
int m = readint();
char cmd[16];
for(i = 0; i < m; i++)
{
scanf("%s", cmd);
if(cmd[0] == 'r')
{
int A, B;
A = readint(), B = readint();
connect(A, B);
}
else if(cmd[0] = 'l')
{
float C;
scanf("%f", &C);
int y = (int)C;
pair<int, int> sd = make_pair(tree1.query(y, y), tree2.query(y, y));
printf("%d %d\n", sd.first, sd.second);
}
}
}
int main() {
int n, m;
while(scanf("%d%d", &n, &m) == 2) {
memset(&tree, 0, sizeof(tree));
while(m--) {
scanf("%d", &op);
if(op == 1) {
scanf("%d%d", &p, &v);
tree.update(1, 1, n);
} else {
scanf("%d%d", &qL, &qR);
printf("%d\n", tree.query(1, 1, n));
}
}
}
return 0;
}
int main() {
int kase = 0, n, a, Q;
while(scanf("%d%d", &n, &Q) == 2) {
prefix_sum[0] = 0;
for(int i = 0; i < n; i++) {
scanf("%d", &a);
prefix_sum[i+1] = prefix_sum[i] + a;
}
tree.build(1, 1, n);
printf("Case %d:\n", ++kase);
while(Q--) {
int L, R;
scanf("%d%d", &L, &R);
qL = L; qR = R;
Interval ans = tree.query(1, 1, n);
printf("%d %d\n", ans.first, ans.second);
}
}
return 0;
}
