For an array (b) of length (m), you may perform the following two operations: Select an index (1\le i\le m - 1). Then, swap the values of (b_i) and (b_{i + 1}). Select an index (1\le i\le m - 2). Then, swap the values of (b_i) and (b_{i + 2}). We define (f(b)) as the minimum number of operations (using both operation 1 and operation 2) required to sort array (b) in non-decreasing order, and (g(b)) as the minimum number of operations required to sort array (b) in non-decreasing order using only operation 1 . The array (b) is perfect if (f(b) = g(b)). In other words, the ability to use operation 2 does not reduce the number of operations required to sort array (b) compared to using only adjacent swaps. You are given a permutation (a) of length (n)(^{\text{∗}}), and must answer (q) queries. Each query consists of two integers (l) and (r) ((1\le l\le r\le n)), representing the subarray (al\ldots r)(^{\text{†}}). For each query, determine whether the subarray (al\ldots r) is perfect. (^{\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). (^{\text{†}})The subarray (al\ldots r) includes all elements from index (l) to (r), i.e., (a_l, a_{l + 1}, a_{l + 2}, \ldots, a_r). Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 5 \cdot 10^4)). The description of the test cases follows. The first line of each test case contains two integers (n), (q) ((1 \le n, q \le 5 \cdot 10^5)) — the length of array (a) and the number of queries. The second line of each test case c