#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  ll N, A, B, X, Y;
  cin >> N >> A >> B >> X >> Y;
  vector<ll> H(N);
  priority_queue <ll> pque;

  for (int i = 0; i < N; ++i) {
    cin >> H[i];
    pque.push(H[i]);
  }

  for (int i = 0; i < A; ++i) {
    ll h = pque.top();
    pque.pop();
    pque.push(h - X);
  }

  ll sum = 0;
  while (not pque.empty()) {
    ll h = pque.top();
    pque.pop();
    sum += max(0LL, h);
  }

  if (sum < B * Y) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }

  return 0;
}