#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int n;
bool f;
void ok(int add_before, int add_after, int median) {
  for (int i = 0; i < add_before; i++) {
    if (f) cout << " ";
    f = 1;
    cout << "1";
  }
  for (int i = 0; i < add_after; i++) {
    if (f) cout << " ";
    f = 1;
    cout << median;
  }
  cout << "\n";
}
int main() {
  int k, p, x, y;
  cin >> n >> k >> p >> x >> y;
  v.resize(k);
  int sum = 0;
  for (int i = 0; i < k; i++) {
    cin >> v[i];
    sum += v[i];
  }
  sort(v.begin(), v.end());
  for (int i = 0; i < k; i++) {
    if (v[i] < y) continue;
    int before = i, after = k - i - 1;
    int add_before = (n / 2) - before, add_after = (n / 2) - after;
    if (before <= n / 2 && after <= n / 2 &&
        sum + add_before + add_after * v[i] <= x) {
      ok(add_before, add_after, v[i]);
      return 0;
    }
  }
  for (int m = y; m <= p; m++) {
    int idx = upper_bound(v.begin(), v.end(), m) - v.begin();
    int before = idx, after = k - idx;
    int add_before = (n / 2) - before, add_after = (n / 2) - after;
    if (before <= n / 2 && after <= n / 2 &&
        sum + m + add_before + add_after * m <= x) {
      cout << m;
      f = 1;
      ok(add_before, add_after, m);
      return 0;
    }
  }
  cout << "-1\n";
}
