Problem: A permutation — is a sequence of length n integers from 1 to n, in which all the numbers occur exactly once. For example, [1], [3, 5, 2, 1, 4], [1, 3, 2] — permutations, and [2, 3, 2], [4, 3, 1], [0] — no.

Polycarp was recently gifted a permutation a[1 ... n] of length n. Polycarp likes trees more than permutations, so he wants to transform permutation a into a rooted binary tree. He transforms an array of different integers into a tree as follows: 

  * the maximum element of the array becomes the root of the tree; 
  * all elements to the left of the maximum — form a left subtree (which is built according to the same rules but applied to the left part of the array), but if there are no elements to the left of the maximum, then the root has no left child; 
  * all elements to the right of the maximum — form a right subtree (which is built according to the same rules but applied to the right side of the array), but if there are no elements to the right of the maximum, then the root has no right child. 



For example, if he builds a tree by permutation a=[3, 5, 2, 1, 4], then the root will be the element a_2=5, and the left subtree will be the tree that will be built for the subarray a[1 ... 1] = [3], and the right one — for the subarray a[3 ... 5] = [2, 1, 4]. As a result, the following tree will be built: 

<image> The tree corresponding to the permutation a=[3, 5, 2, 1, 4].

Another example: let the permutation be a=[1, 3, 2, 7, 5, 6, 4]. In this case, the tree looks like this: 

<image> The tree corresponding to the permutation a=[1, 3, 2, 7, 5, 6, 4].

Let us denote by d_v the depth of the vertex a_v, that is, the number of edges on the path from the root to the vertex numbered a_v. Note that the root depth is zero. Given the permutation a, for each vertex, find the value of d_v.

Input

The first line contains one integer t (1 ≤ t ≤ 100) — the number of test cases. Then t test cases follow.

The first line of each test case contains an integer n (1 ≤ n ≤ 100) — the length of the permutation.

This is followed by n numbers a_1, a_2, …, a_n — permutation a.

Output

For each test case, output n values — d_1, d_2, …, d_n.

Example

Input


3
5
3 5 2 1 4
1
1
4
4 3 1 2


Output


1 0 2 3 1 
0 
0 1 3 2 

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;

public class _1490_D {
    @SuppressWarnings("unchecked")
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(System.out);
		int t = Integer.parseInt(in.readLine());
		for(int i = 0; i < t; i++) {
            int n = Integer.parseInt(in.readLine());
            int[] a = new int[n];
            StringTokenizer line = new StringTokenizer(in.readLine());
            ArrayList<Integer>[] tree = new ArrayList[n];
            for(int j = 0; j < n; j++) {
                a[j] = Integer.parseInt(line.nextToken()) - 1;
                tree[j] = new ArrayList<Integer>();
            }
            int start = build_tree(tree, 0, n - 1, a);
            int[] d = new int[n];
            Arrays.fill(d, -1);
            dfs(tree, start, 0, d);
            StringBuilder sb = new StringBuilder();
            for(int j = 0; j < n; j++) {
                sb.append(d[j]);
                sb.append(' ');
            }
            out.println(sb.toString());
		}
		in.close();
		out.close();
	}
    @SuppressWarnings("unchecked")
    static void dfs(ArrayList<Integer>[] tree, int node, int depth, int[] d) {
        if(d[node] > -1) return;
        d[node] = depth;
        ArrayList<Integer> neighbors = tree[node];
        for(int neighbor : neighbors) {
            dfs(tree, neighbor, depth + 1, d);
        }
    }
    static int build_tree(ArrayList<Integer>[] tree, int l, int r, int[] a) {
        if(l > r) return -1;
        int max = l;
        for(int i = l + 1; i <= r; i++) {
            if(a[i] >= a[max]) max = i;
        }
        int left = build_tree(tree, l, max - 1, a);
        int right = build_tree(tree, max + 1, r, a);
        if(left > -1) tree[max].add(left);
        if(right > -1) tree[max].add(right);
        return max;
    }
}