#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int main() {
  int n, k, p, x, y;
  vector<int> track, ans;
  cin >> n >> k >> p >> x >> y;
  for (int i = 0; i < k; i++) {
    int a;
    cin >> a;
    track.push_back(a);
  }
  sort(track.begin(), track.end());
  int curmed = 0, curmed2 = 0;
  for (int i = 0; i < k; i++) {
    if (track[i] < y)
      curmed++;
    else
      break;
  }
  if (curmed >= (n + 1) / 2) {
    cout << -1;
    return 0;
  }
  for (int i = 0; i < (n - 1) / 2 - curmed; i++) ans.push_back(1);
  for (int i = 0; i < (n + 1) / 2 - k + curmed; i++) ans.push_back(y);
  int sum = 0;
  for (int i = 0; i < k; i++) sum += track[i];
  for (int i = 0; i < n - k; i++) sum += ans[i];
  if (sum > x) {
    cout << -1;
    return 0;
  }
  for (int i = 0; i < n - k; i++) cout << ans[i] << " ";
  return 0;
}
