#include <bits/stdc++.h>
using namespace std;
int a[1000000], ans[1000000];
int n, k, p, x, y, sum = 0;
int main() {
  cin >> n >> k >> p >> x >> y;
  for (int i = 1; i <= k; i++) {
    cin >> a[i];
    sum += a[i];
  }
  if (sum + n - k > x) {
    cout << -1;
    return 0;
  }
  for (int i = k + 1; i <= n; i++) {
    a[i] = y;
    sum += y;
  }
  int id = k + 1;
  while (sum > x) {
    if (a[id] == 1) {
      id++;
      continue;
    }
    a[id]--;
    sum--;
  }
  int c = 0;
  for (int i = k + 1; i <= n; i++) ans[c++] = a[i];
  sort(a + 1, a + n + 1);
  if (a[(n + 1) / 2] < y)
    cout << -1;
  else {
    for (int i = 0; i < c; i++) cout << ans[i] << " ";
  }
  return 0;
}
