#include <bits/stdc++.h>
using namespace std;
long long ng, hg, n, k, p, x, y, a[111111], i, s, o;
map<int, int> m;
vector<int> v;
int main() {
  cin >> n >> k >> p >> x >> y;
  for (i = 1; i <= k; i++) {
    cin >> a[i];
    if (a[i] < y) o++;
    s += a[i];
  }
  if (o < (n + 1) / 2) {
    ng = min((n + 1) / 2 - 1 - o, n - k);
    hg = n - k - ng;
    s += ng + hg * y;
    if (s > x)
      cout << -1;
    else {
      while (ng--) cout << 1 << " ";
      while (hg--) cout << y << " ";
    }
  } else
    cout << -1;
}
