#include <bits/stdc++.h>
using namespace std;
vector<int> res;
int n, k, p, x, y, s, Count, a[10000];
int main() {
  scanf("%d %d %d %d %d", &n, &k, &p, &x, &y);
  for (int i = 1; i <= k; i++) {
    scanf("%d", &a[i]);
    if (a[i] >= y) Count++;
  }
  if (Count >= (n + 1) / 2) {
    for (int i = 1; i <= n - k; i++) {
      a[i + k] = 1;
      res.push_back(1);
    }
  } else {
    for (int i = 1; i <= (n + 1) / 2 - Count; i++) {
      a[++k] = y;
      res.push_back(y);
    }
    for (int i = 1; i <= n - k; i++) {
      a[i + k] = 1;
      res.push_back(1);
    }
  }
  s = 0;
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; i++) s += a[i];
  if (s > x || a[(n + 1) / 2] < y)
    printf("-1");
  else
    for (int i = 0; i < res.size(); i++) printf("%d ", res[i]);
}
