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

void solve() {
	int n; cin >> n;
	vector<int> p(n); map<int, int> cnt;
	for (int i = 0; i < n; i++) {
		cin >> p[i]; cnt[p[i]]++;
		if (cnt[p[i]] == n) {
			cout << "NO\n";
			return;
		}
	}

	set<int> st; vector<int> a;
	for (int i = 0; i < n; i++) {
		st.insert(i);
		a.push_back(i+1);
	}
	sort(a.begin(), a.end(), [&](int x, int y){
		return cnt[x] > cnt[y];
	});

	vector<int> ans(n);
	for (int i: a) {
		for (int j: st) {
			if (p[j] == i) continue;
			ans[j] = i; st.erase(j); break;
		}
	}

	cout << "YES\n";
	for (int i: ans) cout << i << ' ';
		cout << '\n';
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0);
	
	int t; cin >> t;
	while (t--) {
		solve();
	}

	return 0;
}