#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class t, class u>
void chmax(t& first, u second) {
  if (first < second) first = second;
}
template <class t, class u>
void chmin(t& first, u second) {
  if (second < first) first = second;
}
template <class t>
using vc = vector<t>;
template <class t>
using vvc = vc<vc<t>>;
using pi = pair<ll, ll>;
using vi = vc<ll>;
template <class t, class u>
ostream& operator<<(ostream& os, const pair<t, u>& p) {
  return os << "{" << p.first << "," << p.second << "}";
}
template <class t>
ostream& operator<<(ostream& os, const vc<t>& v) {
  os << "{";
  for (auto e : v) os << e << ",";
  return os << "}";
}
using uint = unsigned;
using ull = unsigned long long;
template <class t, size_t n>
ostream& operator<<(ostream& os, const array<t, n>& first) {
  return os << vc<t>(first.begin(), first.end());
}
template <ll i, class T>
void print_tuple(ostream&, const T&) {}
template <ll i, class T, class H, class... Args>
void print_tuple(ostream& os, const T& t) {
  if (i) os << ",";
  os << get<i>(t);
  print_tuple<i + 1, T, Args...>(os, t);
}
template <class... Args>
ostream& operator<<(ostream& os, const tuple<Args...>& t) {
  os << "{";
  print_tuple<0, tuple<Args...>, Args...>(os, t);
  return os << "}";
}
template <class t>
void print(t x, ll suc = 1) {
  cout << x;
  if (suc == 1) cout << "\n";
  if (suc == 2) cout << " ";
}
ll read() {
  ll i;
  cin >> i;
  return i;
}
vi readvi(ll n, ll off = 0) {
  vi v(n);
  for (ll i = ll(0); i < ll(n); i++) v[i] = read() + off;
  return v;
}
template <class T>
void print(const vector<T>& v, ll suc = 1) {
  for (ll i = ll(0); i < ll(v.size()); i++)
    print(v[i], i == ll(v.size()) - 1 ? suc : 2);
}
string readString() {
  string s;
  cin >> s;
  return s;
}
template <class T>
T sq(const T& t) {
  return t * t;
}
void yes(bool ex = true) {
  cout << "YES"
       << "\n";
  if (ex) exit(0);
}
void no(bool ex = true) {
  cout << "NO"
       << "\n";
  if (ex) exit(0);
}
void possible(bool ex = true) {
  cout << "POSSIBLE"
       << "\n";
  if (ex) exit(0);
}
void impossible(bool ex = true) {
  cout << "IMPOSSIBLE"
       << "\n";
  if (ex) exit(0);
}
constexpr ll ten(ll n) { return n == 0 ? 1 : ten(n - 1) * 10; }
const ll infLL = LLONG_MAX / 3;
const ll inf = infLL;
ll topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
ll topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
ll botbit(signed first) { return first == 0 ? 32 : __builtin_ctz(first); }
ll botbit(ll first) { return first == 0 ? 64 : __builtin_ctzll(first); }
ll popcount(signed t) { return __builtin_popcount(t); }
ll popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(ll i) { return i && (i & -i) == i; }
ll mask(ll i) { return (ll(1) << i) - 1; }
bool inc(ll first, ll second, ll c) { return first <= second && second <= c; }
template <class t>
void mkuni(vc<t>& v) {
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
}
ll rand_int(ll l, ll r) {
  static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
  return uniform_int_distribution<ll>(l, r)(gen);
}
template <class t>
void myshuffle(vc<t>& first) {
  for (ll i = ll(0); i < ll(ll(first.size())); i++)
    swap(first[i], first[rand_int(0, i)]);
}
template <class t>
ll lwb(const vc<t>& v, const t& first) {
  return lower_bound(v.begin(), v.end(), first) - v.begin();
}
pair<bool, vi> sub(ll vmax, vi first, ll tar, ll waf) {
  void(0);
  void(0);
  void(0);
  ll n = ll(first.size());
  vi freq(vmax);
  for (auto v : first) freq[v]++;
  vi vals = first;
  sort(vals.begin(), vals.end(),
       [&](ll i, ll j) { return pi(freq[i], i) < pi(freq[j], j); });
  void(0);
  vi c(n, waf);
  if (tar) {
    ll cur = -1, cnt = 0, mx = 0;
    for (ll i = ll(0); i < ll(tar); i++) {
      c[i] = vals[i];
      if (cur != vals[i]) {
        chmax(mx, cnt);
        cur = vals[i];
        cnt = 0;
      }
      cnt++;
    }
    chmax(mx, cnt);
    ll num = count(vals.begin(), vals.end(), cur);
    if (cnt + num > n) return make_pair(false, vi{});
    rotate(c.begin(), c.begin() + mx, c.end());
  }
  map<ll, vi> z;
  for (ll i = ll(0); i < ll(n); i++) z[vals[i]].push_back(c[i]);
  vi res(n);
  for (ll i = ll(0); i < ll(n); i++) {
    res[i] = z[first[i]].back();
    z[first[i]].pop_back();
    assert(first[i] != res[i]);
  }
  return make_pair(true, res);
}
void slv() {
  ll n, x, y;
  cin >> n >> x >> y;
  vi second = readvi(n, -1);
  ll waf = -1;
  {
    vi used(n + 1);
    for (auto v : second) used[v] = 1;
    for (ll i = ll(0); i < ll(n + 1); i++)
      if (!used[i]) waf = i;
  }
  assert(waf != -1);
  vi fix(n);
  {
    vc<pi> ops;
    vi cnt(n + 1);
    for (ll i = ll(0); i < ll(n); i++) {
      ops.emplace_back(cnt[second[i]]++, i);
    }
    sort(ops.begin(), ops.end(), greater<pi>());
    for (ll i = ll(0); i < ll(x); i++) fix[ops[i].second] = 1;
  }
  vi vs;
  for (ll i = ll(0); i < ll(n); i++)
    if (!fix[i]) vs.push_back(second[i]);
  bool ok;
  vi res;
  tie(ok, res) = sub(n + 1, vs, y - x, waf);
  if (ok) {
    ll head = 0;
    for (ll i = ll(0); i < ll(n); i++)
      if (!fix[i]) second[i] = res[head++];
    for (auto& v : second) v++;
    yes(0);
    print(second);
  } else {
    no(0);
  }
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout << fixed << setprecision(20);
  ll t;
  cin >> t;
  for (ll _ = ll(0); _ < ll(t); _++) slv();
}
