#include <bits/stdc++.h>
using namespace std;
int n, k, p, x, y;
int a[1005];
int main() {
  scanf("%d%d%d%d%d", &n, &k, &p, &x, &y);
  for (int i = 1; i <= k; i++) scanf("%d", &a[i]), x -= a[i];
  int ok = 1;
  vector<int> ans;
  for (int i = k + 1; i <= n; i++) {
    int j = y;
    for (; j >= 1; j--) {
      if (j + (n - i) <= x) {
        a[i] = j;
        break;
      }
    }
    if (j == 0) {
      ok = 0;
      break;
    }
    x -= j;
    ans.push_back(j);
  }
  sort(a + 1, a + n + 1);
  if (ok && a[(n + 1) / 2] >= y) {
    for (auto &t : ans) printf("%d ", t);
  } else
    puts("-1");
}
