#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
 
#include<bits/stdc++.h>
using namespace std;
 
int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  ll n,a,b,x,y;
  cin>>n>>a>>b>>x>>y;
  vector<ll> H(n);
  rep(i,n) cin>>H[i];
  
  sort(ALL(H));
  reverse(ALL(H));
  int now=0;
  while(a>0 && now<n && H[now]>=x){
    H[now]-=x;
    a--;
    if(H[now]<x) now++;
  }
  sort(ALL(H));
  reverse(ALL(H));
  now=0;
  while(a>0 && now<n){
    H[now]-=x;
    a--;
    now++;
  }
  if(now==n){
    cout<<"Yes"<<endl;
    return 0;
  }
  ll sum=0;
  rep(i,n){
    if(H[i]>0) sum+=H[i];
  }
  if(sum<=b*y) cout<<"Yes"<<endl;
  else cout<<"No"<<endl;

  return 0;
}