Alice is preparing a cake for her party. However, she is in a rush, so the frosting on the cake is uneven. To quickly solve this issue, Alice will put her knife at some integer height and then sweep the frosting from left to right to make the frosting level. Formally, let (a_i) be the height of the frosting at the (i)-th position. Suppose that Alice puts her knife at some integer height (h). If the height of frosting at position (i) is greater than (h), the excess frosting will be pushed to position (i + 1). Excess frosting on position (n) will be pushed off the cake completely. Alice and her friends really love cake frosting. Since Alice might decide to serve some prefix of the cake instead of the whole cake, help her find the maximum height the frosting can be while keeping the frosting level for the first (i) positions for (i = 1, 2, \ldots, n). Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. The first line of each test case contains an integer (n) ((2 \leq n \leq 2\cdot 10^5)) — the length of Alice's cake. The second line of each test case contains (n) integers (a_1,a_2,\ldots,a_n) ((1 \leq a_i \leq 10^9)) — the height of the frosting at the (i)-th position. The sum of (n) over all test cases is at most (2 \cdot 10^5). For each test case, output (n) integers where the (i)-th integer represents the maximum height the frosting can be while keeping the frosting level for the first (i) positions. The explanation of the first test case is as follows: When (i = 1), Alice is interested in the cake represented by an array (4). Since the cake is already leveled, the maximum height the frosting can be is (4). When (i = 2), Alice is interested in the cake represented by an array (4, 2). If Alice put her knife at height (4), the resulting cak