#include<iostream>
#include<vector>
#include<algorithm>
#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;
    scanf("%d%d%d%lld%lld",&n,&a,&b,&x,&y);
    vector<int> h(n);
    vector<P> hh(n);
    cnt=n;
    rep(i,n){
        scanf("%d",&h[i]);
        hh[i].first=h[i];
        hh[i].second=i;
    }
    sort(hh.rbegin(),hh.rend());
    rep(i,n){
        j=(h[hh[i].second]+x-1)/x;
        h[hh[i].second]-=x*min(a,j);
        a-=min(a,j);
        if(h[hh[i].second]<=0)cnt--;
    }
    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;
}