#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
  long long n, k, p, x, y;
  cin >> n >> k >> p >> x >> y;
  vector<int> v;
  for (int i = 0; i < k; i++) {
    int r;
    cin >> r;
    v.push_back(r);
  }
  int k1 = 0;
  std::vector<int> v1, ele, equal;
  int len = (n - 1) / 2;
  for (int i = 0; i < v.size(); i++) {
    if (v[i] < y) {
      v1.push_back(v[i]);
      len--;
    }
  }
  if (v1.size() > (n - 1) / 2) {
    cout << "-1";
    return 0;
  }
  for (int i = 0; i < v.size(); i++) {
    if (v[i] >= y) {
      v1.push_back(v[i]);
    }
  }
  for (int i = k + 1; i <= n; i++) {
    if (len > 0) {
      --len;
      v1.push_back(1);
      ele.push_back(1);
    } else {
      v1.push_back(y);
      ele.push_back(y);
    }
  }
  long long sum = 0;
  for (int i = 0; i < v1.size(); ++i) {
    sum += v1[i];
  }
  if (sum > x) {
    cout << "-1";
    return 0;
  }
  for (int i = 0; i < ele.size(); ++i) {
    cout << ele[i] << " ";
  }
  return 0;
}
