#include <bits/stdc++.h>
    using namespace std;
    #include <math.h>
    #include <iomanip>
    #include <cstdint>
    #include <string>
    #include <sstream>
    template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
    template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
    #define rep(i,n) for (int i = 0; i < (n); ++i)
    typedef long long ll;
    typedef long double ld;
    typedef unsigned long long ull;
    using P=pair<ll,ll>;
    const ll INF=1001001001;
    const int mod=1e9+7;

    void solve(){
        ll n,a,b,x,y;
        cin>>n>>a>>b>>x>>y;
        vector<ll>h(n);
        rep(i,n)cin>>h[i];
        priority_queue<int>q;
        rep(i,n)q.push(h[i]);
        rep(i,a){
            if(q.empty()){break;}
            int p=q.top();q.pop();
            p-=x;
            if(p>0){q.push(p);}
        }
        ll sum=0;
        while(!q.empty()){
            int p=q.top();q.pop();
            sum+=p;
        }
        cout<<(sum<=b*y?"Yes":"No")<<endl;
    }  

    int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        
        solve(); 

        return 0;
    }