LCIS (2)

LCIS

Time Limit: 1000 MS Memory Limit: 62768 K Total Submit: 39 (28 users) Total Accepted: 25 (24 users) Special Judge: No

Description

Given n integers. You have two operations: U A B: replace the Ath number by B. (index counting from 0) Q A B: output the length of the longest consecutive increasing subsequence (LCIS) in [a, b].

Input

T in the first line, indicating the case number. Each case starts with two integers n , m(0<n,m<=10^5). The next line has n integers(0<=val<=10^5). The next m lines each has an operation: U A B(0<=A,n , 0<=B=10^5) OR Q A B(0<=A<=B<n).

Output

For each Q, output the answer.

Sample Input

1 10 10 7 7 3 3 5 9 9 8 1 8  Q 6 6 U 3 4 Q 0 1 Q 0 5 Q 4 7 Q 3 5 Q 0 2 Q 4 6 U 6 10 Q 0 9

Sample Output

1 1 4 2 3 1 2 5