#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, p, x, y;
  while (cin >> n >> k >> p >> x >> y) {
    int sum = 0;
    int gty = 0, lty = 0, ety = 0;
    for (int i = 0; i < k; i++) {
      int t;
      cin >> t;
      if (t > y) {
        gty++;
      } else if (t < y) {
        lty++;
      } else
        ety++;
      sum += t;
    }
    if (lty >= (n + 1) / 2) {
      cout << "-1\n";
      continue;
    }
    if (sum + (n - k) > x) {
      cout << "-1\n";
      continue;
    }
    int new1 = (n / 2 - lty);
    int newy = ((n + 1) / 2 - gty - ety);
    sum += (new1 + y * newy);
    if (sum > x) {
      cout << "-1\n";
      continue;
    }
    int cnt = 0;
    for (int i = 0; i < n - k; i++) {
      int res = y;
      if (cnt < new1) {
        res = 1;
        cnt++;
      }
      printf("%d%c", res, " \n"[i == n - k - 1]);
    }
  }
}
