B'Ntarsis has an array a of length n . The power of a subarray a_l ... a_r ( 1 <= q l <= q r <= q n ) is defined as: Call an array b a rival to a if the following holds: Ntarsis wants you to find a rival b to a such that the sum of b_i over 1 <= q i <= q n is maximized. Help him with this task! Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 10^5 ). The description of the test cases follows. The first line of each test case has a single integer n ( 1 <= q n <= q 10^5 ). The next line contains n integers a_1, a_2, ldots, a_n ( 1 <= q a_i <= q 10^9 ). It is guaranteed that the sum of n across all test cases does not exceed 2 cdot 10^5 . For each test case, output n integers b_1, b_2, ldots, b_n -- a valid rival to a such that b_1 + b_2 + cdots + b_n is maximal. If there exist multiple rivals with the maximum sum, output any of them. For the first test case, one rival with the maximal sum is [2, 4, 2, 3, 3] . [2, 4, 2, 3, 3] can be shown to be a rival to [1, 4, 1, 3, 3] . All possible subarrays of a and b and their corresponding powers are listed below: It can be shown there exists no rival with a greater sum than 2 + 4 + 2 + 3 + 3 = 14 . '...