#include <bits/stdc++.h>
using namespace std;
int n, m, k, p, x, y, f, kek, all, a[100005];
int main() {
  cin >> n >> k >> p >> x >> y;
  for (int i = 1; i <= k; i++) cin >> a[i];
  int kol = (n + 1) / 2;
  for (int i = 1; i <= k; i++)
    if (a[i] >= y) kol--;
  if (n - k < kol) {
    cout << -1;
    return 0;
  }
  if (kol > 0)
    for (int j = k + 1; j <= k + kol; j++) a[j] = y;
  kol = max(0, kol);
  for (int j = k + kol + 1; j <= n; j++) a[j] = 1;
  int all = 0;
  for (int i = 1; i <= n; i++) all += a[i];
  if (all > x) {
    cout << -1;
    return 0;
  }
  for (int i = k + 1; i <= n; i++) cout << a[i] << ' ';
}
