#include <bits/stdc++.h>
using namespace std;
int pct(int x) { return __builtin_popcount(x); }
int pct(long long x) { return __builtin_popcountll(x); }
int bt(int x) { return 31 - __builtin_clz(x); }
int bt(long long x) { return 63 - __builtin_clzll(x); }
int cdiv(int a, int b) { return a / b + !(a < 0 || a % b == 0); }
long long cdiv(long long a, long long b) {
  return a / b + !(a < 0 || a % b == 0);
}
int nxt_C(int x) {
  int c = x & -x, r = x + c;
  return (((r ^ x) >> 2) / c) | r;
}
long long nxt_C(long long x) {
  long long c = x & -x, r = x + c;
  return (((r ^ x) >> 2) / c) | r;
}
vector<int> get_bits(int mask) {
  vector<int> bb;
  while (mask) {
    int b = bt(mask);
    bb.push_back(b);
    mask ^= (1 << b);
  }
  reverse(bb.begin(), bb.end());
  return bb;
}
int get_mask(vector<int> v) {
  int mask = 0;
  for (int x : v) {
    mask ^= (1 << x);
  }
  return mask;
}
template <typename T>
void uniq(vector<T> &v) {
  sort(v.begin(), v.end());
  v.resize(unique(v.begin(), v.end()) - v.begin());
}
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
long long rand(long long l, long long r) {
  uniform_int_distribution<long long> uid(l, r);
  return uid(rng);
}
void sc() {}
template <typename Head, typename... Tail>
void sc(Head &H, Tail &...T) {
  cin >> H;
  sc(T...);
}
const int mod = 1e9 + 7;
int pwr(int a, long long b) {
  int ans = 1;
  while (b) {
    if (b & 1) ans = (ans * 1LL * a) % mod;
    a = (a * 1LL * a) % mod;
    b >>= 1;
  }
  return ans;
}
const int N = 1e5 + 5;
int a[N], b[N];
bool check(int n, int x, int y) {
  for (int i = 1; i <= n; i++) {
    if (a[i] == b[i]) x--;
  }
  if (x != 0) return 0;
  multiset<int> s(b + 1, b + n + 1);
  for (int i = 1; i <= n; i++) {
    auto it = s.find(a[i]);
    if (it != s.end()) {
      s.erase(it);
    }
  }
  int match = n - (int)s.size();
  if (y != match) return 0;
  return 1;
}
void solve() {
  int n, x, y;
  sc(n, x, y);
  int xx = x, yy = y;
  map<int, int> m;
  for (int i = 1; i <= n; i++) {
    sc(a[i]);
    m[a[i]]++;
  }
  int rem = 0;
  for (int i = 1; i <= n + 1; i++) {
    if (!m.count(i)) {
      rem = i;
      break;
    }
  }
  vector<pair<int, int>> v;
  for (auto x : m) {
    v.push_back({x.second, x.first});
  }
  sort(v.begin(), v.end());
  42;
  map<int, vector<int>> s;
  while (x) {
    int val = v.back().first;
    for (int i = (int)v.size() - 1; i >= 0; i--) {
      if (!x) break;
      if (v[i].first == val) {
        v[i].first--;
        x--;
        s[v[i].second].push_back(v[i].second);
      } else {
        break;
      }
    }
  }
  int mx = 0;
  for (auto x : v) {
    mx = max(mx, x.first);
  }
  vector<int> p;
  for (pair<int, int> x : v) {
    for (int i = 1; i <= x.first; i++) {
      p.push_back(x.second);
    }
  }
  y -= xx;
  for (int i = 0; i < (int)p.size(); i++) {
    if (p[i] == p[(i + mx) % (int)p.size()] || !y) {
      s[p[i]].push_back(rem);
    } else {
      y--;
      42;
      s[p[i]].push_back(p[(i + mx) % (int)p.size()]);
    }
  }
  for (int i = 1; i <= n; i++) {
    b[i] = s[a[i]].back();
    s[a[i]].pop_back();
  }
  if (check(n, xx, yy)) {
    cout << "YES" << '\n';
    for (int i = 1; i <= n; i++) {
      cout << b[i] << " ";
    }
    cout << '\n';
  } else {
    cout << "NO" << '\n';
  }
}
int main() {
  ios ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  cin >> t;
  for (int tt = 1; tt <= t; tt++) {
    solve();
  }
  return 0;
}
