#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e17;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main(){
    ll n;cin >> n;
    ll a,b,x,y;cin >> a >> b >> x >> y;
    vl V(n);rep(i,n)cin >> V[i];
        ll mid=0;
        vl v(n);
        rep(i,n)v[i]=max(0LL,V[i]-mid);
        ll usea=0;
        rep(i,n){
            ll p=v[i]/x;
            ll rem=a-usea;
            rem=min(rem,p);
            usea+=rem;
            v[i]-=rem*x;
        }
        sort(all(v));rev(all(v));
        rep(i,n){
            if(usea!=a){
                usea++;v[i]=0;
            }
        }
        ll al=accumulate(all(v),0LL);
        if(al<=b*y)cout << "Yes" << endl;
        else cout << "No" << endl;
}