B"Polycarp has a favorite sequence a[1 ... n] consisting of n integers. He wrote it out on the whiteboard as follows: For example, if n=7 and a=[3, 1, 4, 1, 5, 9, 2] , then Polycarp will write a sequence on the whiteboard [3, 4, 5, 2, 9, 1, 1] . You saw the sequence written on the whiteboard and now you want to restore Polycarp's favorite sequence. The first line contains a single positive integer t ( 1 <= t <= 300 ) -- the number of test cases in the test. Then t test cases follow. The first line of each test case contains an integer n ( 1 <= n <= 300 ) -- the length of the sequence written on the whiteboard. The next line contains n integers b_1, b_2, ldots, b_n ( 1 <= b_i <= 10^9 ) -- the sequence written on the whiteboard. Output t answers to the test cases. Each answer -- is a sequence a that Polycarp wrote out on the whiteboard. In the first test case, the sequence a matches the sequence from the statement. The whiteboard states after each step look like this: [3] Rightarrow [3, 1] Rightarrow [3, 4, 1] Rightarrow [3, 4, 1, 1] Rightarrow [3, 4, 5, 1, 1] Rightarrow [3, 4, 5, 9, 1, 1] Rightarrow [3, 4, 5, 2, 9, 1, 1] . "...