D. Permutation Restoration

Monocarp had a permutation aa of nn integers 11, 22, ..., nn (a permutation is an array where each element from 11 to nn occurs exactly once).

Then Monocarp calculated an array of integers bb of size nn, where bi=⌊iai⌋bi=⌊iai⌋. For example, if the permutation aa is [2,1,4,3][2,1,4,3], then the array bb is equal to [⌊12⌋,⌊21⌋,⌊34⌋,⌊43⌋]=[0,2,0,1][⌊12⌋,⌊21⌋,⌊34⌋,⌊43⌋]=[0,2,0,1].

Unfortunately, the Monocarp has lost his permutation, so he wants to restore it. Your task is to find a permutation aa that corresponds to the given array bb. If there are multiple possible permutations, then print any of them. The tests are constructed in such a way that least one suitable permutation exists.

Input

The first line contains a single integer tt (1≤t≤1051≤t≤105) — number of test cases.

The first line of each test case contains a single integer nn (1≤n≤5⋅1051≤n≤5⋅105).

The second line contains nn integers b1,b2,…,bnb1,b2,…,bn (0≤bi≤n0≤bi≤n).

Additional constrains on the input:

• the sum of nn over test cases does not exceed 5⋅1055⋅105;
• there exists at least one permutation aa that would yield this array bb.

Output

For each test case, print nn integers — a permutation aa that corresponds to the given array bb. If there are multiple possible permutations, then print any of them.

Example

input

Copy

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

output

Copy

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

 思路：推柿子可以推出来a[i]的范围是【i / (b[i] + 1 ) ,i / b[i]】

然后我们就能推出来数组里每一个数的范围

我们从1开始选位置

找出1所在的范围之后，贪心取右边界最小的下标放这个1

例如当两个区间是（1,3）和（1，8）时，我们选（1,3）这个区间所在的下标放1

那么当下次的数是4的时候，我们就可以选（1,8）这个区间，即（1,8）能够给更多的数的选择的机会

当遇到右边界一样的情况的时候，我们任意选一个位置放就可以了。

www实现起来对于我这个菜鸡好复杂啊参考了别的dalao的代码。。。薄弱的stl知识让我回去重修语法课呜呜呜

#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#include<stack>
#define int long long
#define lowbit(x) x&(-x)
#define PI 3.1415926535
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int gcd(int a,int b){
	return b>0 ? gcd(b,a%b):a;
}
const int N=5e5+10;
int n;
struct name{
	int l,r,idx;
};
bool cmp(name a,name b){
	return a.l <b.l ;
}
int a[N];
name q[N];
void sove(){
	cin>>n;
	for(int i=1;i<=n;i++){
		int x;
		cin>>x;
		if(x==0){
			q[i]={i+1,n,i};
		}else{
			int left=i/(x+1)+1;
			int right=i/x;
			q[i]={left,right,i};
		}
	}
	sort(q+1,q+1+n,cmp);
	priority_queue<pii,vector<pii>,greater<pii>> h;
	int num=0;
	for(int i=1;i<=n;i++){
		while(num+1<=n&&q[num+1].l ==i){
			h.push({q[++num].r ,q[num].idx }); 
		}
		a[h.top() .second]=i;
		h.pop();
	}
	for(int i=1;i<=n;i++)cout<<a[i]<<" ";
	cout<<endl;
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie() ,cout.tie() ;
	int t=1;
	cin>>t;
	while(t--){
		sove();
	}
	return 0;
}