B'You are given an array a of size n . A segment [l, r](1 <= l < r <= n) is called a polygonal segment only if the following conditions hold: Process q queries of two types: The first line contains an integer t ( 1 <= q t <= q 10^4 ) -- the number of test cases. For each test case: It is guaranteed that the sum of n over all test cases will not exceed 2 cdot 10^5 , and the sum of q over all test cases will not exceed 10^5 . For each query, if there is no suitable segment, output -1 in a new line. Otherwise, output the length of the longest segment satisfying the condition above in a new line. In the first query of the first test case, there is no polygonal segment under the given condition. For example, considering segment [1,3] , you can not form a triangle with side lengths of a_1=3 , a_2=1 , and a_3=2 . In the second query of the first test case, the longest polygonal segment is [1,4] . You can form a quadrilateral with side lengths of a_1=3 , a_2=1 , a_3=2 , and a_4=2 . '...