#ifdef LOCAL
#include "stdafx.h"
#else
#include <bits/stdc++.h>
#define IL inline
#define LL long long
#define eb emplace_back
#define sz(v) ((int) (v).size())
#define me(f, x) memset(f, x, sizeof(f))
#define mc(f, g) memcpy(f, g, sizeof(g))
#define L(i, j, k) for (int i = (j); i <= (k); ++i)
#define R(i, j, k) for (int i = (j); i >= (k); --i)
#define FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)
using namespace std;

using vi = vector<int>;
#endif

constexpr int N = 2e5 + 9;
int n, p[N], d[N];
list<int>::iterator it[N];

void slv () {
  cin >> n;
  L (i, 1, n) {
    cin >> p[i];
  }
  L (i, 1, n) {
    if (p[i] > i) {
      cout << "No\n";
      return;
    }
  }
  L (i, 1, n) {
    d[i] = d[p[i]] ^ 1;
  }
  list<int> lis;
  L (i, 1, n) {
    if (p[i] == i || !d[i]) {
      it[i] = lis.insert(lis.end(), i);
    } else {
      it[i] = lis.insert(it[p[i]], i);
    }
  }
  L (i, 1, n) {
    if (p[i] == i || d[i]) {
      it[i] = lis.insert(lis.end(), i);
    } else {
      it[i] = lis.insert(it[p[i]], i);
    }
  }
  cout << "Yes\n";
  for (int x : lis) {
    cout << x << ' ';
  }
  cout << '\n';
}

int main () {
  ios::sync_with_stdio(0), cin.tie(0);
  int T;
  cin >> T;
  while (T--) {
    slv();
  }
}
// I love WHQ!