#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int n, k, p, x, y;
int sum = 0;
int a[N], b[N];
int main() {
  cin >> n >> k >> p >> x >> y;
  for (int i = 1; i <= k; ++i) {
    cin >> a[i];
    sum += a[i];
  }
  for (int i = k + 1; i <= n; ++i) {
    a[i] = 1;
    ++sum;
  }
  if (sum > x) {
    puts("-1");
    return 0;
  }
  for (int i = k + 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      b[j] = a[j];
    }
    sort(b + 1, b + n + 1);
    if (b[n / 2 + 1] < y) {
      a[i] += y - 1;
      sum += y - 1;
      if (sum > x) {
        puts("-1");
        return 0;
      }
    }
  }
  for (int i = 1; i <= n; ++i) b[i] = a[i];
  sort(b + 1, b + n + 1);
  if (b[n / 2 + 1] < y) {
    puts("-1");
    return 0;
  }
  for (int i = k + 1; i <= n; ++i) cout << a[i] << " ";
  return 0;
}
