#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, tl1, hd2, tl2, dep[maxn], nxt[N], n;
vector<int> g[maxn], vec[maxn];
int p1[maxn], p2[maxn];

void dfs(int u)
{
    if (dep[u]) vec[dep[u]].emplace_back(u);
    for (int v : g[u]) dep[v] = dep[u] + 1, dfs(v);
}

bool c[maxn];

void work()
{
    cin >> n;
    for (int i = 1; i <= n; i++) dep[i] = 0, g[i].clear();
    for (int i = 1; i <= 2 * n; i++) nxt[i] = 0;
    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[a[i]].emplace_back(i);

    int k1 = 0, k2 = 0;
    for (int u = 1; u <= n; u++)
    {
        if (a[u] != u) continue;
        dfs(u);
        int hd1 = u + n, hd2 = 0, tl1 = u + n, tl2 = 0;
        for (int x : g[u])
        {
            if (!tl2) hd2 = tl2 = x + n;
            nxt[tl2] = x + n, tl2 = x + n;
        }
        if (tl2) nxt[tl2] = u, tl2 = u;
        else hd2 = tl2 = u;

        for (int i = 1; i <= n; i++)
        {
            if (!vec[i].size()) break;
            sort(vec[i].begin(), vec[i].end());
            for (int x : vec[i])
            {
                sort(g[x].begin(), g[x].end());
                for (int y : g[x]) nxt[tl1] = y + n, tl1 = y + n;
                nxt[tl1] = x, tl1 = x;
            }
            vec[i].clear();
            swap(hd1, hd2), swap(tl1, tl2);
        }
        for (int i = hd1, j = hd2; i; i = nxt[i], j = nxt[j]) p1[++k1] = (i > n ? i - n : i), p2[++k2] = (j > n ? j - n : j);
    }
    cout << "Yes\n"; for (int i = 1; i <= n; i++) cout << p1[i] << " "; for (int i = 1; i <= n; i++) cout << p2[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;
}