**Sanvi** is a very cute girl.She is walking on the corridor from left to right. There are total **N** bulbs on the corridor which are separated with unit distance between them. Each bulb has certain brightness power in watt (**Wi**). For every bulb at position **i** , **Sanvi** wants to determine the minimum distance she needs to walk on the right side of the corridor so that she could get the brightest bulb in the range from position **i** to **N**.
Input:
------
Input starts with an integer **T (1<=T<=20)**, denoting the number of test cases.
Each case contains an integer **N (1 ≤ N ≤ 100000)** denoting the number of bulbs. Next line contain N space separated integer numbers **(1<=Wi<=10^9)** denoting brightness power of bulb at respective position.
Output:
-------
For each case of input, output a single line with **N** space separated integer numbers denoting the minimum walking distance as described in the problem statement.
Sample Input
------------
1
6
6 5 6 1 5 2
Sample Output
-------------
0 1 0 1 0 0