#include<stdio.h>#include<string.h>#define MAXD 200010#define INF 0x3f3f3f3fint N, M, T, node, left[MAXD], right[MAXD], size[MAXD], key[MAXD], max[MAXD], pre[MAXD], a[MAXD];int getmax(int x, int y, int z){int t = x > y ? x : y;return t > z ? t : z;}void update(int x){    size[x] = size[left[x]] + size[right[x]] + 1;    max[x] = getmax(key[x], max[left[x]], max[right[x]]);}void left_rotate(int x){int y = right[x], p = pre[x];    right[x] = left[y];if(right[x])        pre[right[x]] = x;    left[y] = x;    pre[x] = y;    pre[y] = p;if(p != 0)        right[p] == x ? right[p] = y : left[p] = y;else        T = y;    update(x);}void right_rotate(int x){int y = left[x], p = pre[x];    left[x] = right[y];if(left[x])        pre[left[x]] = x;    right[y] = x;    pre[x] = y;    pre[y] = p;if(p != 0)        right[p] == x ? right[p] = y : left[p] = y;else        T = y;    update(x);}void add(int &T, int v){    T = ++ node;    key[T] = max[T] = v;    size[T] = 1;    left[T] = right[T] = 0;}void build(int &T, int x, int y, int fa){int mid = (x + y) / 2;    add(T, a[mid]);    pre[T] = fa;if(x < mid)        build(left[T], x, mid - 1, T);if(mid < y)        build(right[T], mid + 1, y, T);    update(T);}void init(){int i, j, k;    T = node = left[0] = right[0] = size[0] = 0;    max[0] = key[0] = -INF;    add(T, -INF), add(right[T], -INF);    pre[T] = 0, pre[node] = T;    size[T] = 2;for(i = 1; i <= N; i ++)        scanf("%d", &a[i]);    build(left[right[T]], 1, N, right[T]);    update(right[T]), update(T);}void splay(int x, int goal){int y, z;for(;;)    {if((y = pre[x]) == goal)break;if((z = pre[y]) == goal)            right[y] == x ? left_rotate(y) : right_rotate(y);else        {if(right[z] == y)            {if(right[y] == x)                    left_rotate(z), left_rotate(y);else                    right_rotate(y), left_rotate(z);            }else            {if(left[y] == x)                    right_rotate(z), right_rotate(y);else                    left_rotate(y), right_rotate(z);            }        }    }    update(x);}void rotate_to(int k, int goal){int i = T, n;for(;;)    {        n = size[left[i]] + 1;if(n == k)break;if(k < n)            i = left[i];else        {            k -= n;            i = right[i];        }    }    splay(i, goal);}void query(int x, int y){    rotate_to(x, 0), rotate_to(y + 2, T);    printf("%d\n", max[left[right[T]]]);}void refresh(int x, int v){    rotate_to(x + 1, 0);    key[T] = v;    update(T);}void solve(){int i, j, k, x, y;char b[5];for(i = 0; i < M; i ++)    {        scanf("%s%d%d", b, &x, &y);if(b[0] == 'Q')            query(x, y);else            refresh(x, y);    }}int main(){while(scanf("%d%d", &N, &M) == 2)    {        init();        solve();    }return 0;}