#include <bits/stdc++.h>
using namespace std;

#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define orange(a...) orange_(#a, a)
#define debug(a...) debug_(#a, a)
template <typename i>
void orange_(const char * s, i l, i r) {
    cerr << "\e[1;32m[ " << s << " ] = [ ";
    for (int f = 0; l != r; l++)
        cerr << (f++ ? " " : "") << *l;
    cerr << " ]\e[0m\n";
}
template <typename ...T>
void debug_(const char * s, T ...a) {
    cerr << "\e[1;32m(" << s << ") = (";
    int cnt = sizeof...(T);
    (..., (cerr << a << (--cnt ? ", " : ")\e[0m\n")));
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

int main() {
    mt19937 rng(114514);
    cin.tie(nullptr)->sync_with_stdio(false);
    int T;
    cin >> T;
    while (T--) {
        int n;
        cin >> n;
        vector<int> a(n), p(n);
        for (int i = 0; i < n; i++) {
            cin >> a[i];
            --a[i];
        }

        bool allsame = true;
        for (int i = 1; i < n; i++) {
            if (a[i] != a[0])
                allsame = false;
        }
        if (allsame) {
            cout << "NO\n";
            continue;
        }
        iota(p.begin(), p.end(), 0);
        do {
            shuffle(p.begin(), p.end(), rng);
            bool ok = true;
            for (int i = 0; i < n; i++)
                if (a[i] == p[i])
                    ok = false;
            if (ok)
                break;
        } while (true);

        cout << "YES\n";
        for (int i = 0; i < n; i++)
            cout << p[i]+1 << (i+1==n ? '\n' : ' ');
    }
    return 0;
}