#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int sc[1005];
  int n, k, p, x, y;
  cin >> n >> k >> p >> x >> y;
  for (int i = 1; i <= k; i++) {
    cin >> sc[i];
    x -= sc[i];
  }
  if (x < 0) {
    cout << -1 << endl;
  } else {
    int i;
    int left_cnt = 0;
    int rig_cnt = 0;
    int equ_y_num = 0;
    int half = n / 2;
    sort(sc + 1, sc + k + 1);
    for (i = 1; i <= k; i++) {
      if (sc[i] < y) {
        left_cnt++;
      } else if (sc[i] == y) {
        equ_y_num++;
      } else {
        rig_cnt++;
      }
    }
    if (left_cnt > half) {
      cout << -1 << endl;
      return 0;
    }
    if (rig_cnt + equ_y_num >= (half + 1)) {
      int need = n - k;
      if (need > x) {
        cout << -1 << endl;
        return 0;
      } else {
        int time = n - k;
        while (time--) {
          cout << 1 << ' ';
        }
        cout << endl;
        return 0;
      }
    }
    int need = half + 1 - rig_cnt - equ_y_num;
    need = need * y;
    need += half - left_cnt;
    if (need > x) {
      cout << -1 << endl;
      return 0;
    } else {
      int time = n - k;
      int left_time = half - left_cnt;
      while ((left_time--)) {
        cout << 1 << ' ';
        time--;
      }
      while ((time--)) {
        cout << y << ' ';
      }
      cout << endl;
    }
  }
  return 0;
}
