1 #include <bits/stdc++.h>
 2 using namespace std;
 3
 4 #define lrt rt << 1
 5 #define rrt rt << 1 | 1
 6 typedef struct Node {
 7     int l, r;
 8     int ls, s, rs;
 9 }Node;
10 const int maxn = 100100;
11 char cmd[5];
12 int n, q;
13 int x[maxn];
14 Node seg[maxn<<4];
15
16 void pushUP(int rt, int len) {
17   seg[rt].ls = seg[lrt].ls; seg[rt].rs = seg[rrt].rs;
18   if(seg[rt].ls == len-len/2) {
19     if(x[seg[lrt].r] < x[seg[rrt].l]) {
20       seg[rt].ls += seg[rrt].ls;
21     }
22   }
23   if(seg[rt].rs == len/2) {
24     if(x[seg[lrt].r] < x[seg[rrt].l]) {
25       seg[rt].rs += seg[lrt].rs;
26     }
27   }
28   seg[rt].s = max(seg[lrt].s, seg[rrt].s);
29   if(x[seg[lrt].r] < x[seg[rrt].l]) {
30     seg[rt].s = max(seg[rt].s, seg[lrt].rs+seg[rrt].ls);
31   }
32 }
33
34 void build(int l, int r, int rt) {
35     seg[rt].l = l; seg[rt].r = r;
36     if(l == r) {
37     seg[rt].ls = seg[rt].rs = seg[rt].s = 1;
38     return;
39     }
40     int mid = (l + r) >> 1;
41   build(l, mid, lrt);
42   build(mid+1, r, rrt);
43   pushUP(rt, r-l+1);
44 }
45
46 void update(int L, int R, int rt) {
47   if(L <= seg[rt].l && seg[rt].r <= R) {
48     seg[rt].ls = seg[rt].rs = seg[rt].s = 1;
49     return;
50   }
51   int mid = (seg[rt].l + seg[rt].r) >> 1;
52   if(L <= mid) update(L, R, lrt);
53   if(mid < R) update(L, R, rrt);
54   pushUP(rt, seg[rt].r-seg[rt].l+1);
55 }
56
57 int query(int L, int R, int rt) {
58   if(L == seg[rt].l && R == seg[rt].r) return seg[rt].s;
59   int mid = (seg[rt].l + seg[rt].r) >> 1;
60   if(mid >= R) return query(L, R, lrt);
61   else if(mid + 1 <= L) return query(L, R, rrt);
62   else {
63     int tmp = max(query(L, mid, lrt), query(mid+1, R, rrt));
64     if(x[seg[lrt].r] < x[seg[rrt].l]) {
65       tmp = max(tmp, min(seg[lrt].rs, mid-L+1)+min(seg[rrt].ls, R-mid));
66     }
67     return tmp;
68   }
69 }
70
71 int main() {
72 //    freopen("in", "r", stdin);
73     int T, a, b;
74     scanf("%d", &T);
75     while(T--) {
76         scanf("%d %d", &n, &q);
77         for(int i = 1; i <= n; i++) {
78             scanf("%d", &x[i]);
79         }
80         build(1, n, 1);
81         while(q--) {
82             scanf("%s %d %d", cmd, &a, &b);
83             a++;
84             if(cmd[0] == 'U') {
85                 x[a] = b;
86         update(a, a, 1);
87             }
88             else {
89                 b++;
90         printf("%d\n", query(a, b, 1));
91             }
92         }
93     }
94     return 0;
95 }