#include <bits/stdc++.h>
int main() {
  int n, k, p, x, y, i, s = 0, c1 = 0, c2 = 0, c;
  scanf("%d %d %d %d %d", &n, &k, &p, &x, &y);
  int ara[n];
  for (i = 0; i < k; i++) {
    scanf("%d", &ara[i]);
    s += ara[i];
    if (ara[i] >= y)
      c1++;
    else
      c2++;
  }
  c = c1 - c2;
  if (c2 >= (n / 2 + 1)) {
    printf("-1");
    return 0;
  }
  for (i = k; i < n; i++) {
    if (c > 0) {
      ara[i] = 1;
      s += 1;
      c--;
    } else {
      ara[i] = y;
      s += y;
      c++;
    }
    if (s > x) {
      printf("-1");
      return 0;
    }
  }
  for (i = k; i < n; i++) {
    printf("%d ", ara[i]);
  }
  return 0;
}
