#include<bits/stdc++.h>
using namespace std;
const int N=205;
int p[N],q[N],pos[N],fa[N],pp[N];
int fi(int x){
	return fa[x]==x?x:fa[x]=fi(fa[x]);
}
void solve(){
	int n;cin>>n;for(int i=1;i<=n;i++) fa[i]=i;
	for(int i=1;i<=n;i++) cin>>p[i],pos[p[i]]=i,fa[fi(i)]=fi(p[i]);
	for(int i=1;i<n;i++) if(fi(pos[i])!=fi(pos[i+1])) swap(p[pos[i]],p[pos[i+1]]),swap(pos[i],pos[i+1]),fa[fi(pos[i])]=fi(pos[i+1]);
	int u=1;q[1]=1;
	for(int i=1;i<n;i++) u=p[u],q[i+1]=u;
	reverse(q+1,q+1+n);
	for(int i=1;i<=n;i++) cout<<q[i]<<" \n"[i==n];
}
signed main(){
	ios::sync_with_stdio(false),cin.tie(NULL),cout.tie(0);
	int T;cin>>T;
	while(T--) solve();
	return 0;
}