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

int a[maxn], hd1[maxn], tl1[maxn], hd2[maxn], tl2[maxn], nxt[N], n;
vector<int> g[maxn];

void dfs(int u)
{
    sort(g[u].begin(), g[u].end());
    hd1[u] = tl1[u] = u;
    hd2[u] = u + n + 1, tl2[u] = u + n + 1;
    for (int v : g[u])
    {
        dfs(v);
        nxt[tl2[u]] = hd2[v], tl2[u] = tl2[v];
        if (~nxt[hd1[v]]) nxt[tl1[u]] = nxt[hd1[v]], tl1[u] = tl1[v];
    }
    reverse(g[u].begin(), g[u].end());
    for (int v : g[u]) nxt[hd1[v]] = hd1[u], hd1[u] = hd1[v];
    swap(hd1[u], hd2[u]), swap(tl1[u], tl2[u]);
}

void work()
{
    cin >> n;
    for (int i = 0; i <= n; i++) g[i].clear(), hd1[i] = hd2[i] = tl1[i] = tl2[i] = -1;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++)
        if (a[i] > i) return cout << "No\n", void();
        else if (a[i] == i) g[0].emplace_back(i);
        else g[a[i]].emplace_back(i);
    for (int i = 0; i <= 2 * n + 1; i++) nxt[i] = -1;
    dfs(0);
    cout << "Yes\n";
    for (int i = hd1[0]; ~i; i = nxt[i]) if (i != 0 && i != n + 1) cout << (i > n + 1 ? i - n - 1 : i) << " ";
    for (int i = hd2[0]; ~i; i = nxt[i]) if (i != 0 && i != n + 1) cout << (i > n + 1 ? i - n - 1 : i) << " ";
    cout << "\n";
}

int main()
{
    ios::sync_with_stdio(0), cin.tie(0);

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