#include <bits/stdc++.h>
using namespace std;
const int inf = INT_MAX;
const long long INF = LLONG_MAX;
const long long mod = 1e9 + 7;
const long long val = 1000001;
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long n, k, p, x, y;
  cin >> n >> k >> p >> x >> y;
  vector<long long int> a(k);
  long long sum = 0;
  for (long long int i = 0; i <= k - 1; i++) {
    cin >> a[i];
    sum += a[i];
  }
  if (sum > x) {
    cout << "-1";
    return 0;
  }
  int count = 0;
  for (long long int i = 0; i <= k - 1; i++) {
    if (a[i] < y) count++;
  }
  if (count > n / 2) {
    cout << "-1";
    return 0;
  }
  int count1 = k - count;
  int countmain = count1;
  vector<long long int> ans;
  long long var = 0;
  if (count1 < n / 2 + 1) {
    for (long long int i = count1 + 1; i <= n / 2 + 1; i++) {
      countmain++;
      ans.push_back(y);
      var += y;
    }
  }
  if (sum + var > x) {
    cout << "-1";
    return 0;
  }
  for (long long int i = count + 1; i <= n - countmain; i++) {
    ans.push_back(1);
    var += 1;
  }
  if (sum + var > x) {
    cout << "-1";
    return 0;
  }
  n = ans.size();
  for (long long int i = 0; i <= n - 1; i++) cout << ans[i] << " ";
  return 0;
}
