#include <bits/stdc++.h>
using namespace std;
int arr[1000000];
int main() {
  int n, k, p, x, y;
  cin >> n >> k >> p >> x >> y;
  vector<int> t;
  t.resize(k);
  for (int i = 0; i < k; i++) cin >> t[i];
  int m = 0;
  for (int i = 0; i < k; i++) m += t[i] >= y ? 1 : -1;
  while (m != 0)
    if (m < 0) {
      t.push_back(y);
      m++;
    } else {
      t.push_back(1);
      m--;
    }
  while (t.size() < n) {
    t.push_back(y);
    t.push_back(1);
  }
  vector<int> r;
  for (int i = k; i < n; i++) r.push_back(t[i]);
  sort(t.begin(), t.begin() + n);
  m = 0;
  for (int i = 0; i < n; i++) m += t[i];
  if (t[n / 2] < y || m > x)
    cout << -1 << endl;
  else {
    for (int i : r) cout << i << " ";
    cout << endl;
  }
  return 0;
}
