#include <bits/stdc++.h>
using namespace std;
deque<int> A;
int a, b, c, k, n, p, x, y;
int main() {
  cin >> n >> k >> p >> x >> y;
  for (int i = 0; i < k; ++i) {
    cin >> a;
    A.push_back(a);
  }
  a = n - k;
  b = 0;
  for (int i = 0; i < a; ++i) {
    A.push_back(1);
  }
  sort(A.begin(), A.end());
  c = n >> 1;
  while (A[c] < y && a > 0) {
    A.pop_front();
    --a;
    ++b;
  }
  if (A[c] < y) {
    cout << -1 << endl;
    return 0;
  }
  for (int i = 0; i < b; ++i) {
    A.push_back(y);
  }
  c = 0;
  for (int i = 0; i < (int)A.size(); ++i) {
    c += A[i];
  }
  if (c > x) {
    cout << -1 << endl;
    return 0;
  }
  while (a--) {
    cout << 1 << " ";
  }
  while (b--) {
    cout << y << " ";
  }
  cout << endl;
  return 0;
}
