#include<bits/stdc++.h>
using namespace std;
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define mod 998244353
#define ll long long
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
inline int read()
{
	char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
	int ans=0; while(isdigit(ch)) {ans=ans*10+ch-48;ch=getchar();}
	if(nega==-1) return -ans;
	return ans;
}
void print(vector<int> x){for(int i=0;i<(int)x.size();i++) printf("%d%c",x[i]," \n"[i==(int)x.size()-1]);}
#define N 400005
int pre[N],suf[N],v[N],a[N],pos[N],op[N],n;
void work()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		v[i]=read();
		if(v[i]>i)
		{
			cout<<"No\n";
			return ;
		}
	}
	memset(pre,0,sizeof(pre));
	memset(suf,0,sizeof(suf));
	int H=0,T=2*n+1;
	suf[H]=T,pre[T]=H;
	auto ins=[&](int pos,int val) // pos (val) pos+1
	{
		int nxt=suf[pos];
		suf[pos]=val,pre[val]=pos;
		suf[val]=nxt,pre[nxt]=val;
	};
	int mid=H;
	for(int i=1;i<=n;i++)
	{
		if(v[i]==i) 
		{
			ins(mid,i);
			ins(H,i+n);
			pos[i]=i+n;
			op[i]=1,op[i+n]=0;
			if(i==1) mid=i+n;
		}
		else
		{
			int p=pos[v[i]],o=op[p];
			if(o==0)
			{
				ins(pre[T],i),op[i]=1,pos[i]=i;
				ins(pre[p],i+n),op[i+n]=0;
			}
			else
			{
				ins(H,i),op[i]=0,pos[i]=i;
				ins(p,i+n),op[i+n]=1;
			}
		}
	}
	int cur=H;
	for(int i=1;i<=2*n;i++)
	{
		cur=suf[cur];
		if(cur<=n) a[i]=cur;
		else a[i]=cur-n;
	}
	for(int i=1;i<=n*2;i++) printf("%d%c",a[i]," \n"[i==n*2]);
}
signed main()
{
	int T=read(); while(T--) work();
	return 0;
}