#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll=long long;
using Graph=vector<vector<pair<int,ll>>>;
#define INF 1000000000000000000
#define MOD 998244353
#define MAX 200000

int main(){
  int N;
  ll A,B,X,Y;
  cin>>N>>A>>B>>X>>Y;
  vector<ll> H(N);
  for(int i=0;i<N;i++){
    cin>>H[i];
  }
  for(int i=0;i<N;i++){
    ll cnt=min<ll>(H[i]/X,A);
    A-=cnt;
    H[i]-=A*X;
  }
  sort(H.begin(),H.end());
  ll sum=0;
  for(int i=0;i<N-(int)A;i++){
    sum+=H[i];
  }
  if(sum<=B*Y){
    cout<<"Yes"<<'\n';
  }else{
    cout<<"No"<<'\n';
  }

}