#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
int n, k, p, x, y, a[maxn];
int main() {
  while (scanf("%d%d%d%d%d", &n, &k, &p, &x, &y) != EOF) {
    int ans = 0, cou = 0, sum = 0;
    for (int i = 0; i < k; i++) {
      scanf("%d", &a[i]);
      ans += a[i];
      if (a[i] >= y) {
        cou++;
        sum += a[i];
      }
    }
    sort(a, a + k);
    if (ans + n - k > x)
      printf("-1\n");
    else {
      int mid = (n + 1) / 2;
      if (k >= mid && a[mid - 1] < y)
        printf("-1\n");
      else if (cou < mid) {
        if (y * (n - cou - mid + 1) + (mid - 1 - (k - cou)) + ans <= x) {
          for (int i = 0; i < n - k; i++) {
            if (i < (n - cou) - mid + 1)
              printf("%d", y);
            else
              printf("1");
            if (i != n - k - 1) printf(" ");
          }
          printf("\n");
        } else
          printf("-1\n");
      } else if (ans + n - k <= x) {
        for (int i = 0; i < n - k; i++) {
          printf("1");
          if (i != n - k - 1) printf(" ");
        }
        printf("\n");
      }
    }
  }
  return 0;
}
