#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
const ll mod = 998244353;
const int maxn = 2e5 + 5;

int a[maxn], dep[maxn], p[maxn];
vector<int> g[maxn], vec;
bool pop[maxn];

void dfs(int u)
{
    vec.emplace_back(u);
    for (int v : g[u])
        if (v > u) dfs(v);
}

void work()
{
    int n; cin >> n;
    for (int i = 1; i <= n; i++) g[i].clear(), cin >> a[i];
    for (int i = 1; i <= n; i++)
    {
        if (a[i] > i) return cout << "No\n", void();
        if (a[i] < i) dep[i] = dep[a[i]] + 1, g[i].emplace_back(a[i]), g[a[i]].emplace_back(i);
        else dep[i] = 0;
    }
    for (int i = 1; i <= n; i++) sort(g[i].begin(), g[i].end());
    
    cout << "Yes\n";
    for (int op = 0; op < 2; op++)
    {
        int k = 0;
        for (int i = 1; i <= n; i++) pop[i] = 0;
        for (int i = 1; i <= n; i++)
        {
            if (a[i] != i) continue;
            vec.clear(), dfs(i);
            sort(vec.begin(), vec.end());
            for (int u : vec)
                if (op ^ (dep[u] & 1))
                {
                    for (int v : g[u])
                        if (!pop[v]) pop[v] = 1, p[++k] = v;
                    p[++k] = u, pop[u] = 1;
                }
            for (int u : vec)
                if (!pop[u]) p[++k] = u;
        }
        for (int i = 1; i <= n; i++) cout << p[i] << " ";
    }
    cout << "\n";
}

int main()
{
    // freopen("c.in", "r", stdin);
    ios::sync_with_stdio(0), cin.tie(0);

    int T; cin >> T;
    while (T--) work();
    return 0;
}