B"A tree is a connected graph without cycles. A permutation is an array consisting of n distinct integers from 1 to n in any order. For example, [5, 1, 3, 2, 4] is a permutation, but [2, 1, 1] is not a permutation (as 1 appears twice in the array) and [1, 3, 2, 5] is also not a permutation (as n = 4 , but 5 is present in the array). After a failed shoot in the BrMeast video, Alex fell into depression. Even his birthday did not make him happy. However, after receiving a gift from Timofey, Alex's mood suddenly improved. Now he spent days playing with the gifted constructor. Recently, he came up with an unusual entertainment. Alex builds a tree from his constructor, consisting of n vertices numbered from 1 to n , with the root at vertex 1 . Then he writes down each integer from 1 to n in some order, obtaining a permutation p . After that, Alex comes up with q triples of integers l, r, x . For each triple, he tries to determine if there is at least one descendant of vertex x among the vertices p_l, p_{l+1}, ldots, p_r . A vertex u is a descendant of vertex v if and only if mathrm{dist}(1, v) + mathrm{dist}(v, u) = mathrm{dist}(1, u) , where mathrm{dist}(a, b) is the distance between vertices a and b . In other words, vertex v must be on the path from the root to vertex u . Alex told Zakhar about this entertainment. Now Alex tells his friend q triples as described above, hoping that Zakhar can check for the presence of a descendant. Zakhar is very sleepy, so he turned to you for help. Help Zakhar answer all of Alex's questions and finally go to sleep. The first line of the input contains a single integer t ( 1 <= t <= 10^4 ) -- the number of test cases. The first line of each test case contains two integers n, q ( 1 <= n, q <= 10^5 ) -- the number of vertices in the tr"...