#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, k, p, mx, md;
  cin >> n >> k >> p >> mx >> md;
  vector<pair<long long, long long> > v(n + 1, make_pair(md, 0));
  v[0] = (make_pair(-1, 2));
  long long sum, ind = (n + 1) / 2;
  vector<long long> add;
  for (long long i = 1; i <= k; ++i) {
    cin >> sum;
    v[i] = make_pair(sum, 1);
  }
  sort(v.begin(), v.end());
  for (long long i = 1; i <= ind - 1; ++i)
    if (!v[i].second) v[i].first = 1;
  sum = 0;
  for (long long i = 1; i <= n; ++i) sum += v[i].first;
  if (sum > mx || v[ind].first < md)
    cout << -1;
  else {
    for (long long i = 1; i <= n; ++i)
      if (!v[i].second) cout << v[i].first << ' ';
  }
}
