#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000;
int a[maxn];
int n, k, p, x, y, sum = 0;
int main() {
  scanf("%d %d %d %d %d", &n, &k, &p, &x, &y);
  for (int i = 0; i < k; i++) scanf("%d", a + i);
  for (int i = 0; i < k; i++) sum += a[i];
  int count = 0;
  for (int i = 0; i < k; i++)
    if (a[i] < y) count++;
  int l = n / 2 - count < n - k ? n / 2 - count : n - k;
  int m = n - k - l;
  if (l < 0 || sum + l + m * y > x)
    printf("-1");
  else {
    while (m--) printf("%d ", y);
    while (l--) printf("1 ");
  }
  return 0;
}
