#include<iostream>
#include<cstdio>
#include<vector>
#define N 400000
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int T,n,v[N+1],length,depth[N+1],nt[N+1],pv[N+1],nt2[N+1],pv2[N+1];
void adder(int x,int d)
{
	int y=nt[x];
	nt[x]=d,pv[d]=x,nt[d]=y,pv[y]=d;
	return;
}
void adder2(int x,int d)
{
	int y=nt2[x];
	nt2[x]=d,pv2[d]=x,nt2[d]=y,pv2[y]=d;
	return;
}
int main()
{
	bool op;
	int x;
	T=read();
	while (T--)
	{
		n=read(),length=0,op=1;
		for (int i=1;i<=n;++i) v[i]=read(),op&=(v[i]<=i);
		if (!op) puts("No");
		else
		{
			for (int i=2;i<=n;++i)
			{
				if (v[i]<i) depth[i]=depth[v[i]]+1;
				else depth[i]=0;
			}
			nt[0]=nt2[0]=n+1,pv[n+1]=pv2[n+1]=0;
			for (int i=1;i<=n;++i)
			{
				if (!depth[i]) adder(pv[n+1],i),adder2(0,i);
				else if (depth[i]&1) adder(pv[n+1],i),adder2(v[i],i);
				else adder(pv[v[i]],i),adder2(0,i);
			}
			puts("Yes");
			x=n+1;
			for (int i=1;i<=n;++i) x=pv[x],printf("%d ",x);
			x=0;
			for (int i=1;i<=n;++i) x=nt2[x],printf("%d ",x);
			puts("");
		}
	}
	return 0;
}