#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


vector<int> calc(const vector<int> &as) {
  const int N = (int)as.size() / 2;
  vector<int> ls(N, -1), rs(N, -1);
  for (int i = 0; i <   N; ++i) ls[as[i]] = i;
  for (int i = N; i < 2*N; ++i) rs[as[i]] = i;
  vector<int> bs(N, 0);
  for (int a = 0; a < N; ++a) {
    int f = 0;
    for (int i = ls[a]; i <= rs[a]; ++i) f ^= 1 << as[i];
    bs[a] = __builtin_ctz(~f);
  }
  return bs;
}

void exper() {
  for (int N = 1; N <= 6; ++N) {
    map<vector<int>, vector<vector<int>>> ma;
    vector<int> as(2*N);
    for (int i = 0; i < 2*N; ++i) as[i] = i % N;
    do {
      do {
        const auto bs = calc(as);
        // cout << as << ": " << bs << '\n';
        ma[bs].push_back(as);
      } while (next_permutation(as.begin() + N, as.end()));
    } while (next_permutation(as.begin(), as.begin() + N));
    cerr << "N = " << N << ": |ma| = " << ma.size() << endl;
    if (N <= 5) {
      for (const auto &kv : ma) {
        cout << kv.first << " " << kv.second.size() << " " << kv.second << '\n';
      }
    }
  }
}

vector<int> solve(const vector<int> &P) {
  const int N = P.size();
  vector<vector<int>> graph(N);
  for (int u = 0; u < N; ++u) {
    if (0 <= P[u] && P[u] <= u) {
      if (P[u] < u) graph[P[u]].push_back(u);
    } else {
      return {};
    }
  }
  vector<int> que;
  vector<int> dep(N, 0);
  for (int u = 0; u < N; ++u) if (P[u] == u) {
    que.push_back(u);
  }
  for (int j = 0; j < N; ++j) {
    const int u = que[j];
    for (const int v : graph[u]) {
      dep[v] = dep[u] + 1;
      que.push_back(v);
    }
  }
  vector<int> ans;
  for (int s = 0; s < 2; ++s) {
    if (s) {
      for (int u = 0; u < N; ++u) if (P[u] == u) ans.push_back(u);
    }
    for (const int u : que) if ((dep[u] & 1) == s) {
      for (const int v : graph[u]) ans.push_back(v);
      ans.push_back(u);
    }
  }
  return ans;
}

int main() {
  // exper();
  
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    int N;
    scanf("%d", &N);
    vector<int> P(N);
    for (int u = 0; u < N; ++u) {
      scanf("%d", &P[u]);
      --P[u];
    }
    
    const auto ans = solve(P);
    if (ans.size()) {
      puts("Yes");
      for (int i = 0; i < 2*N; ++i) {
        if (i) printf(" ");
        printf("%d", ans[i] + 1);
      }
      puts("");
    } else {
      puts("No");
    }
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}