Reconstruct the Queue

The construction worker Adrian has little to do today, so he is collecting material for his study of shop queues.

Adrian watches the queue in front of a nearby shop and, for each person who arrives in turn, writes down the position in the queue that person took. At the start of the day the queue was empty. A new arrival did not necessarily stand at the very back: by arranging things with someone, paying someone, handing over something, or in some other way, a person could cut into any position in the queue. Once someone joined the queue they never left it, until noon, when it turned out the shop would not open that day and everyone dispersed.

Using only his notes, Adrian wonders whether the arrangement of the queue just before everyone dispersed can be reconstructed.

The first line contains the number of test sets $Z$ ($1 \le Z \le 10$). The test sets then follow one after another.

The first line of each set contains a natural number $N$ ($1 \le N \le 100000$), the number of people who joined the queue between morning and noon. The second line contains $N$ integers $X_1, X_2, \dots, X_N$ ($0 \le X_i < i$, for $1 \le i \le N$).

If $X_i$ is $0$, the $i$-th person stood at the very front of the queue. Otherwise the $i$-th person stood directly behind the person who, at the moment they arrived, was the $X_i$-th person counting from the front of the queue.

For each set, print on its own line $N$ integers separated by single spaces. The $i$-th integer must be the final position of the person who joined the queue $i$-th. The person at the front of the queue has position $1$, the next has position $2$, and so on.