For the sequence {a_n}, let’s define the beautiful number of a_i is j, where j is the minimum index with a_j >a_i and j > i. If no such j, the beautiful number of a_i is 0. For each i in range [1, n], please output its corresponding beautiful number j.

The first line will be an integer T, which is the number of test cases. (1 <= T <= 10)

For each test case, the first line will be the integer n. (1 <= n <= 5*10⁵)

Then there will n lines, and the ith line will have a number represent a_i. (0 <= a_i <= 10⁵)

N lines for each test case. The beautiful number of a_i

Median problem