#include <bits/stdc++.h>
using namespace std;
int dir[8][2] = {{1, 0}, {-1, 0}, {0, 1},  {0, -1},
                 {1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
int main() {
  int n, k, p, x, y;
  int cntY = 0, a[1100] = {0}, sum = 0;
  scanf("%d %d %d %d %d", &n, &k, &p, &x, &y);
  for (int i = 1; i <= k; i++) {
    scanf("%d", &a[i]);
    sum += a[i];
    if (a[i] >= y) cntY++;
  }
  int Mid = (n + 1) / 2;
  if (cntY >= Mid) {
    sum += (n - k);
    if (sum > x)
      printf("-1\n");
    else {
      for (int i = 1; i <= (n - k); i++) printf("1%c", i == n - k ? '\n' : ' ');
    }
  } else {
    sum += y * (Mid - cntY) + n - k - Mid + cntY;
    if (sum > x || k - cntY >= Mid)
      printf("-1\n");
    else {
      for (int i = 1; i <= (Mid - cntY); i++)
        printf("%d%c", y, i == n - k ? '\n' : ' ');
      for (int i = 1; i <= n - k - Mid + cntY; i++)
        printf("1%c", i == n - k - Mid + cntY ? '\n' : ' ');
    }
  }
  return 0;
}
