#include <bits/stdc++.h>
using namespace std;
int main(){
  int N, A, B, X, Y;
  cin >> N >> A >> B >> X >> Y;
  vector<int> H(N);
  for (int i = 0; i < N; i++){
    cin >> H[i];
  }
  priority_queue<int> pq;
  for (int i = 0; i < N; i++){
    pq.push(H[i]);
  }
  for (int i = 0; i < A; i++){
    if (!pq.empty()){
      int x = pq.top();
      pq.pop();
      if (x > X){
        pq.push(x - X);
      }
    }
  }
  long long sum = 0;
  while (!pq.empty()){
    sum += pq.top();
    pq.pop();
  }
  if (sum <= (long long) B * Y){
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
}