#include <bits/stdc++.h>
using namespace std;
const int N = int(3e6);
int n, k, p, x, y, t;
int a[N], b[N];
int second;
int main() {
  scanf("%d%d%d%d%d", &n, &k, &p, &x, &y);
  for (int i = 1; i <= k; i++) {
    scanf("%d", &a[i]);
    second += a[i];
  }
  for (int i = k + 1; i <= n; i++) {
    a[i] = 1;
  }
  sort(a + 1, a + k + 1);
  t = second + n - k;
  int cnt = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i] >= y) cnt++;
  }
  if (t > x) {
    cout << -1;
    return 0;
  }
  if (cnt > n / 2) {
    for (int i = k + 1; i <= n; i++) {
      cout << a[i] << " ";
    }
    return 0;
  }
  for (int i = k + 1; i <= n; i++) {
    if (a[i] < y) {
      t += (y - a[i]);
      a[i] = y;
      cnt++;
      if (a[i] > p || t > x) {
        cout << "-1";
        return 0;
      }
      if (cnt > n / 2) {
        for (int i = k + 1; i <= n; i++) {
          cout << a[i] << " ";
        }
        return 0;
      }
    }
  }
  cout << -1;
  return 0;
}
