#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y);
long long mpower(long long x, long long y, long long p);
long long modInv(long long a, long long m);
long long gcdExtended(long long a, long long b, long long *x, long long *y);
bool isPrime(long long n);
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t, i, j, k, l, h, p, q, r, x, y, z, a, b, c, d, f, n, m,
      M = 1000000007;
  char ch, ch2, ch3;
  string s, s1, s2, s3;
  cin >> t;
  while (t--) {
    vector<pair<long long, long long> > v, w;
    unordered_map<long long, long long> N;
    set<pair<long long, long long> > S, SS;
    cin >> n >> x >> y;
    vector<long long> vv[n + 2];
    long long A[n], B[n], C[n + 2];
    for (i = 0; i < n; i++) {
      B[i] = -1;
      cin >> A[i];
      vv[A[i]].push_back(i);
    }
    for (i = 0; i < n; i++) {
      S.insert(make_pair(vv[A[i]].size(), A[i]));
    }
    for (i = 1; i < (n + 2); i++) {
      C[i] = 0;
      if (vv[i].size() == 0) {
        a = i;
      }
    }
    y -= x;
    p = (n - x) / 2;
    while (x) {
      pair<long long, long long> aa = *S.rbegin();
      if (aa.first == 1) {
        break;
      }
      S.erase(aa);
      x--;
      aa.first--;
      B[vv[aa.second][C[aa.second]]] = aa.second;
      C[aa.second]++;
      S.insert(make_pair(aa.first, aa.second));
    }
    while (x--) {
      pair<long long, long long> aa = *S.rbegin();
      S.erase(aa);
      B[vv[aa.second][C[aa.second]]] = aa.second;
      C[aa.second]++;
    }
    for (i = 0; i < n; i++) {
      if (B[i] == -1) {
        v.push_back(make_pair(A[i], i));
      }
    }
    sort(v.begin(), v.end());
    if (v.size()) {
      for (i = 0; i < v.size() && y; i++) {
        j = (i + p) % v.size();
        pair<long long, long long> aa = v[j];
        if (v[j].first == v[i].first) {
          continue;
        }
        B[v[j].second] = v[i].first;
        y--;
      }
    }
    if (y) {
      cout << "NO\n";
    } else {
      cout << "YES\n";
      for (i = 0; i < n; i++) {
        if (B[i] == -1) {
          cout << a << " ";
        } else {
          cout << B[i] << " ";
        }
      }
      cout << "\n";
    }
  }
  return 0;
}
long long modInv(long long a, long long m) {
  long long x, y;
  long long g = gcdExtended(a, m, &x, &y);
  long long res = (x % m + m) % m;
  return res;
}
long long gcdExtended(long long a, long long b, long long *x, long long *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  long long x1, y1;
  long long gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
long long mpower(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long power(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = res * x;
    y = y >> 1;
    x = x * x;
  }
  return res;
}
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  long long p = sqrt(n);
  for (int i = 5; i <= p; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
