#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
#define int long long
static const int mod=998244353;

signed main(){   
  int n,a,b,x,y;
  cin>>n>>a>>b>>x>>y;
  priority_queue<int>pq;
  rep(i,n){
    int temp;
    cin>>temp;
    pq.push(temp);
  }
  rep(i,a){
    int temp=pq.top();
    pq.pop();
    temp-=x;
    pq.push(temp);
  }
  //cout<<pq.top()<<endl;
  rep(i,b){
    int res=y;
    while(res>0){
      //cout<<res<<endl;
      if(pq.top()<=0){
        cout<<"Yes"<<endl;
        return 0;
      }
      if(pq.top()<=res){
        res-=pq.top();
        pq.pop();
        pq.push(0);
      } 
      else{
        int temp=pq.top()-res;
        pq.pop();
        pq.push(temp);
        res=0;
      }
    }
  }
  while(!pq.empty()){
    //cout<<pq.top()<<endl;
    if(pq.top()>0){
      cout<<"No"<<endl;
      return 0;
    }
    pq.pop();
  }
  cout<<"Yes"<<endl;
  return 0;
}