#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; #define FOR(i,l,r) for(ll i=l;i=l;i--) #define RREP(i,n) RFOR(i,0,n) #define ALL(x) x.begin(),x.end() #define P pair #define F first #define S second #define BS(A,x) binary_search(ALL(A),x) #define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin()) #define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin()) #define COU(A,x) UB(A,x)-LB(A,x) templateusing min_priority_queue=priority_queue,greater>; using mint=modint1000000007; //using mint=modint998244353; void chmax(ll&a,ll b){a=max(a,b);} void chmin(ll&a,ll b){a=min(a,b);} signed main(){ ll N,A,B,X,Y;cin>>N>>A>>B>>X>>Y; vectorH(N);REP(i,N)cin>>H[i]; if(A)REP(i,N){ ll c=min(H[i]/A,X); H[i]-=A*c;X-=c; } else X=0; sort(ALL(H));reverse(ALL(H)); REP(i,N)if(X&&H[i]){ H[i]=0;X--; } ll sum=0; REP(i,N)sum+=H[i]; if(sum>B*Y)cout<<"No"<