#include <bits/stdc++.h>
using namespace std;
int n, k, p, x, y, xx, mid;
int a[1100], ans[1100];
int main() {
  while (cin >> n >> k >> p >> x >> y) {
    memset(a, 0, sizeof(a));
    memset(ans, 0, sizeof(ans));
    int sum = 0, cnt = 0;
    int l = 0, r = 0;
    for (int i = 0; i < k; i++) {
      cin >> a[i];
      sum += a[i];
      if (a[i] < y)
        l++;
      else if (a[i] >= y)
        r++;
    }
    mid = n / 2 + 1;
    if (l >= mid) {
      cout << "-1" << endl;
      continue;
    }
    if (r <= mid) {
      xx = mid - r;
      while (xx--) {
        ans[cnt++] = y;
        sum += y;
      }
    }
    xx = n - r - l - cnt;
    while (xx--) {
      ans[cnt++] = 1;
      sum++;
    }
    if (sum > x) {
      cout << "-1" << endl;
      continue;
    } else {
      cout << ans[0];
      for (int i = 1; i < cnt; i++) {
        cout << " " << ans[i];
      }
      cout << endl;
    }
  }
  return 0;
}
