B"You have a deck of n cards, and you'd like to reorder it to a new one. Each card has a value between 1 and n equal to p_i . All p_i are pairwise distinct. Cards in a deck are numbered from bottom to top, i. e. p_1 stands for the bottom card, p_n is the top card. In each step you pick some integer k > 0 , take the top k cards from the original deck and place them, in the order they are now, on top of the new deck. You perform this operation until the original deck is empty. (Refer to the notes section for the better understanding.) Let's define an order of a deck as sum limits_{i = 1}^{n}{n^{n - i} cdot p_i} . Given the original deck, output the deck with maximum possible order you can make using the operation above. The first line contains a single integer t ( 1 <= t <= 1000 ) -- the number of test cases. The first line of each test case contains the single integer n ( 1 <= n <= 10^5 ) -- the size of deck you have. The second line contains n integers p_1, p_2, ... , p_n ( 1 <= p_i <= n ; p_i neq p_j if i neq j ) -- values of card in the deck from bottom to top. It's guaranteed that the sum of n over all test cases doesn't exceed 10^5 . For each test case print the deck with maximum possible order. Print values of cards in the deck from bottom to top. If there are multiple answers, print any of them. In the first test case, one of the optimal strategies is the next one: In the second test case, one of the optimal strategies is: In the third test case, one of the optimal strategies is: "...