#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
int a[1111];
int main() {
  int n, k, p, x, y;
  cin >> n >> k >> p >> x >> y;
  int sum = 0;
  for (int i = 0; i < k; i++) {
    scanf("%d", &a[i]);
    sum += a[i];
  }
  if (sum + (n - k) > x) {
    puts("-1");
    return 0;
  }
  int val = x - sum;
  vector<int> ans;
  for (int i = k; i < n; i++) {
    if (y + (n - i - 1) > val) {
      ans.push_back(1);
      a[i] = 1;
      val -= 1;
    } else {
      ans.push_back(y);
      a[i] = y;
      val -= y;
    }
  }
  sort(a, a + n);
  if (a[n / 2] >= y) {
    for (int i = 0; i < ans.size(); i++) printf("%d ", ans[i]);
    puts("");
  } else
    puts("-1");
}
