#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1005;
int n, k, p, x, y;
int ar[MAXN];
bool check() {
  int sum = 0;
  for (int i = 1; i <= k; ++i) {
    sum += ar[i];
  }
  sort(ar + 1, ar + 1 + k);
  int i = 0;
  while (i < k && ar[i + 1] < y) {
    ++i;
  }
  int j = k - i;
  for (int t = k + 1; t <= n; ++t) {
    if (j > i) {
      ar[t] = 1;
      sum += 1;
      ++i;
    } else {
      ar[t] = y;
      sum += y;
      ++j;
    }
  }
  return j <= i || sum > x;
}
int main(int argc, char *argv[]) {
  cin >> n >> k >> p >> x >> y;
  for (int i = 1; i <= k; ++i) {
    cin >> ar[i];
  }
  if (check()) {
    cout << -1 << endl;
  } else {
    for (int i = k + 1; i <= n; ++i) {
      cout << ar[i] << ' ';
    }
    cout << endl;
  }
  return 0;
}
