#include <bits/stdc++.h>
using namespace std;
int const N = 1005;
int n, k, p, x, y, v[N];
vector<int> ans;
int main() {
  cin >> n >> k >> p >> x >> y;
  int a = 0, b = 0, sum = 0;
  for (int i = 1; i <= k; i++) {
    cin >> v[i];
    sum += v[i];
    if (v[i] < y)
      a++;
    else
      b++;
  }
  if (a > (n / 2)) {
    cout << "-1";
    return 0;
  }
  for (int i = 1; i <= (n / 2) - a; i++) {
    if (ans.size() == n - k) break;
    ans.push_back(1);
    sum++;
  }
  b = n - (n / 2) - b;
  for (int i = 1; i <= b; i++) {
    if (ans.size() == n - k) break;
    ans.push_back(y);
    sum += y;
  }
  if (sum > x) {
    cout << "-1";
    return 0;
  }
  for (auto i : ans) cout << i << " ";
}
