#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using mint = modint998244353;

int main() {
  ll N, A, B, X, Y; cin >> N >> A >> B >> X >> Y;
  priority_queue<ll> pq;
  for (int i = 0; i < N; i++) {
    ll h; cin >> h;
    pq.push(h);
  }
  for (int i = 0; i < A; i++) {
    ll h = pq.top(); pq.pop();
    pq.push(max(0LL, h - X));
  }
  ll sum = 0;
  while (!pq.empty()) {
    ll h = pq.top(); pq.pop();
    sum += h;
  }
  if (sum <= B * Y) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
  return 0;
}