#include <bits/stdc++.h>
using namespace std;
int n, k, p, x, y, a[1234], b[1234];
int main() {
  scanf("%d %d %d %d %d", &n, &k, &p, &x, &y);
  for (int i = 0; i < k; i++) {
    scanf("%d", &a[i]);
    b[i] = a[i];
  }
  for (int i = 0; i <= n - k; i++) {
    for (int j = 0; j < n; j++) a[j] = b[j];
    for (int j = 0; j < i; j++) a[k + j] = y;
    for (int j = i; j < n - k; j++) a[k + j] = 1;
    sort(a, a + n);
    int s = 0;
    for (int j = 0; j < n; j++) s += a[j];
    if (s <= x && a[n / 2] >= y) {
      for (int j = 0; j < i; j++) printf("%d ", y);
      for (int j = i; j < n - k; j++) {
        if (j != i) printf(" ");
        printf("1");
      }
      printf("\n");
      return 0;
    }
  }
  printf("-1\n");
  return 0;
}
