#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, k, p, x, y, m1, sum = 0;
  cin >> n >> k >> p >> x >> y;
  m1 = ceil(n / 2.0);
  int ar[k], ans[n - k];
  for (long long i = 0; i < k; i++) cin >> ar[i], sum += ar[i];
  sort(ar, ar + k);
  int ind = lower_bound(ar, ar + k, y) - ar;
  if (ar[k - 1] < y && k >= m1) {
    cout << -1;
    return 0;
  } else if (ind >= m1) {
    cout << -1;
    return 0;
  }
  if ((ind + (n - k)) <= (m1 - 1)) {
    if ((sum + (n - k) * 1) > x) {
      cout << -1;
      return 0;
    }
    for (long long i = 0; i < n - k; i++) cout << 1 << " ";
  } else {
    if ((sum + (m1 - ind - 1) * 1 + ((n - k) - (m1 - ind - 1)) * y) > x) {
      cout << -1;
      return 0;
    }
    for (long long i = 0; i < m1 - ind - 1; i++) cout << 1 << " ";
    for (long long i = 0; i < ((n - k) - (m1 - ind - 1)); i++) cout << y << " ";
  }
  return 0;
}
