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