#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e3 + 10;
int arr[MAXN];
vector<int> mas, ans;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, k, p, x, y, h = 0;
  cin >> n >> k >> p >> x >> y;
  for (int i = 1; i <= k; ++i) {
    cin >> arr[i];
    if (arr[i] < y) h++;
    mas.push_back(arr[i]);
  }
  if (h >= (n + 1) / 2) {
    cout << -1;
    return 0;
  }
  for (int i = k - h + 1; i <= (n + 1) / 2; ++i) {
    mas.push_back(y);
    ans.push_back(y);
  }
  for (int i = mas.size() + 1; i <= n; ++i) {
    mas.push_back(1);
    ans.push_back(1);
  }
  h = 0;
  for (int i = 0; i < mas.size(); ++i) h += mas[i];
  if (h > x) {
    cout << -1;
    return 0;
  }
  for (int i = 0; i < ans.size(); ++i) cout << ans[i] << " ";
  return 0;
}
