#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#define rep(i,n) for(i=0;i<(int)(n);i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

typedef pair<int,int> P;

int n,a,b;
ll x,y;

int main(){
    int i,j,cnt;
    ll p,d;
    P now;
    scanf("%d%d%d%lld%lld",&n,&a,&b,&x,&y);
    vector<int> h(n);
    cnt=n;
    priority_queue<P> PQ;
    rep(i,n){
        scanf("%d",&h[i]);
        PQ.push(P(h[i],i));
    }
    while(PQ.size()&&a>0){
        now=PQ.top();PQ.pop();
        h[now.second]-=x;
        now.first=h[now.second];
        if(h[now.second]<=0)cnt--;
        else PQ.push(now);
        a--;
    }
    p=y*b;
    rep(i,n){
        if(h[i]>0){
            d=min((ll)h[i],p);
            h[i]-=d;
            p-=d;
            if(h[i]<=0)cnt--;
        }
    }
    printf("%s\n",cnt==0?"Yes":"No");
    return 0;
}