#include <bits/stdc++.h>
using namespace std;
int a[10100];
int b[10100];
int main() {
  int n, k, p, x, y;
  cin >> n >> k >> p >> x >> y;
  int cnt = 0;
  for (int i = 1; i <= k; i++) {
    cin >> a[i];
    if (a[i] >= y) cnt++;
  }
  int mid = (n + 1) / 2;
  int need = mid - cnt;
  for (int i = k + 1; i <= k + need; i++) {
    a[i] = y;
  }
  if (need < 0) need = 0;
  for (int i = k + need + 1; i <= n; i++) {
    a[i] = 1;
  }
  int sum = 0;
  for (int i = 1; i <= n; i++) {
    sum += a[i];
  }
  bool ok = 1;
  if (sum > x) ok = 0;
  for (int i = 1; i <= n; i++) b[i] = a[i];
  sort(b + 1, b + n + 1);
  if (b[mid] < y) ok = 0;
  if (ok) {
    for (int i = k + 1; i <= n; i++) {
      cout << a[i] << " ";
    }
  } else {
    cout << "-1" << endl;
  }
  return 0;
}
