B"Polycarp wrote on a whiteboard an array p of length n , which is a permutation of numbers from 1 to n . In other words, in p each number from 1 to n occurs exactly once. He also prepared a resulting array a , which is initially empty (that is, it has a length of 0 ). After that, he did exactly n steps. Each step looked like this: Note that on the last step, p has a length of 1 and its minimum element is both leftmost and rightmost. In this case, Polycarp can choose what role the minimum element plays. In other words, this element can be added to a both on the left and on the right (at the discretion of Polycarp). Let's look at an example. Let n=4 , p=[3, 1, 4, 2] . Initially a=[] . Then: Thus, a possible value of a after n steps could be a=[1,3,2,4] . You are given the final value of the resulting array a . Find any possible initial value for p that can result the given a , or determine that there is no solution. The first line of the input contains an integer t ( 1 <= t <= 10^4 ) -- the number of test cases in the test. Each test case consists of two lines. The first of them contains an integer n ( 1 <= n <= 2 cdot10^5 ) -- the length of the array a . The second line contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= n ) -- the elements of the array a . All elements of the a array are distinct numbers. It is guaranteed that the sum of the values n over all test cases in the test does not exceed 2 cdot10^5 . Print t lines, each of the lines must contain the answer to the corresponding set of input data: numbers p_1, p_2, ... , p_n -- any of the possible initial values of the array p , which will lead to the given array a . All elements of p are distinct integers from 1 to n . Thus, if there are several solutions, print "...