#pragma GCC optimize("O3") #include<bits/stdc++.h> using namespace std; using ll=long long; using P=pair<ll,ll>; template<class T> using V=vector<T>; #define fi first #define se second #define all(v) (v).begin(),(v).end() const ll inf=(1e18); //const ll mod=998244353; const ll mod=1000000007; const vector<int> dy={-1,0,1,0},dx={0,-1,0,1}; ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;} ll LCM(ll c,ll d){return c/GCD(c,d)*d;} struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} __init; template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; } template<class T>void debag(const vector<T> &a){cerr<<"debag :";for(auto v:a)cerr<<v<<" ";cerr<<"\n";} template<class T>void print(const vector<T> &a){for(auto v:a)cout<<v<<" ";cout<<"\n";} int main(){ int n; cin>>n; ll a,b,x,y; cin>>a>>b>>x>>y; V<ll> h(n); set<P> s; for(int i=0;i<n;i++){ cin>>h[i]; s.emplace(h[i],i); } ll l=-1,r=(ll)1e10; while(r-l>1){ ll mid=(l+r)/2; mid=0; V<ll> cp(n); ll cnt=a; for(int i=0;i<n;i++){ cp[i]=h[i]-mid; if(cp[i]>=0){ ll d=cp[i]/x; ll v=min(cnt,d); cnt-=v; cp[i]-=x*v; } } sort(all(cp),greater<ll>()); ll num=0; for(int i=0;i<n;i++){ if(cp[i]>0&&cnt>0){ cp[i]=0; cnt--; } if(cp[i]>0){ num+=cp[i]; } } if(num<=b*y){ cout<<"Yes"<<"\n"; r=mid; } else { cout<<"No"<<"\n"; l=mid; } return 0; } cout<<r<<"\n"; }