QED is given a permutation(^{\text{∗}}) (p) of length (n). He also has a string (s) of length (n) containing only characters (L) and (R). QED only likes permutations that are sorted in non-decreasing order. To sort (p), he can select any of the following operations and perform them any number of times: Choose an index (i) such that (s_i = L). Then, swap (p_i) and (p_{i-1}). It is guaranteed that (s_1 \neq L). Choose an index (i) such that (s_i = R). Then, swap (p_i) and (p_{i+1}). It is guaranteed that (s_n \neq R). He is also given (q) queries. In each query, he selects an index (i) and changes (s_i) from (L) to (R) (or from (R) to (L)). Note that the changes are persistent . After each query, he asks you if it is possible to sort (p) in non-decreasing order by performing the aforementioned operations any number of times. Note that before answering each query, the permutation (p) is reset to its original form. (^{\text{∗}})A permutation of length (n) is an array consisting of (n) distinct integers from (1) to (n) in arbitrary order. For example, (2,3,1,5,4) is a permutation, but (1,2,2) is not a permutation ((2) appears twice in the array), and (1,3,4) is also not a permutation ((n=3) but there is (4) in the array). The first line contains (t) ((1 \leq t \leq 10^4)) — the number of test cases. The first line of each test case contains two integers (n) and (q) ((3 \leq n \leq 2 \cdot 10^5), (1 \leq q \leq 2 \cdot 10^5)) – the length of the permutation and the number of queries. The following line contains (n) integers (p_1, p_2, \ldots, p_n) ((1 \leq p_i \leq n), (p) is a permutation). The following line contains (n) characters (s_1s_2 \ldots s_n). It is guaranteed