Given an array of elements of length N, ranging from 0 to N-1, your task is to write a program that rearranges the elements of the array. All elements may not be present in the array, if element is not present then there will be -1 present in the array. Rearrange the array such that A[i] = i and if i is not present, display -1 at that place.

Examples:

Input : arr = {-1, -1, 6, 1, 9, 3, 2, -1, 4, -1}
Output : [-1, 1, 2, 3, 4, -1, 6, -1, -1, 9]

Input : arr = {19, 7, 0, 3, 18, 15, 12, 6, 1, 8,
              11, 10, 9, 5, 13, 16, 2, 14, 17, 4}
Output : [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 
         11, 12, 13, 14, 15, 16, 17, 18, 19]

Input:
The first line of the input contains an integer T, denoting the number of test cases. Then T test case follows. The first line of each test case contains an integer N, denoting the number of elements in an array. Next line contains N space separated integers denoting the elements of the array.

Output:
For each test case output a single line containing space separated elements of the new array.

Constraints:
1<=T<=10³
0<=N<=10⁵
-1<=A[]<=N-1

Example:
Input:
2
10
-1 -1 6 1 9 3 2 -1 4 -1
3
2 0 1
Output:
-1 1 2 3 4 -1 6 -1 -1 9
0 1 2