#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (ll)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(ll i=0;i<n;i++)
#define crep(i,x,n) for(ll i=x;i<n;i++)
#define drep(i,n) for(ll i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _3pPbCt8 ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
using pii=pair<ll,ll>;
using vi=vector<ll>;

int main(){
_3pPbCt8;
	ll n,ca,cb,x,y;
	cin>>n>>ca>>cb>>x>>y;
	vi a(n);
	rep(i,n){
		cin>>a[i];
	}
	auto f=[&](ll need)->ll{
		ll now=0;
		rep(i,n){
			// h - x * e <= need
			// (h - need)/x <= e
			ll e=max(0ll,(a[i]-need)/x);
			if(a[i]-e*x>need) e++;
			now+=e;
		}
		return (now<=ca);
	};
	ll l=0,r=1e9,c=-1;
	while(l<=r){
		ll m=(l+r)>>1;
		if(f(m)){
			c=m;
			r=m-1;
		}else{
			l=m+1;
		}
	}
	ll need=c;
	rep(i,n){
		if(a[i]>c){
			ll e=max(0ll,(a[i]-need)/x);
			if(a[i]-e*x>need) e++;
			if(ca>=e){
				a[i]-=e*x;
				ca-=e;
			}
		}
		a[i]=max(a[i],0ll);
	}
	ll _sum=0;
	rep(i,n){
		_sum+=a[i];
	}
	if((_sum+y-1)/y<=cb){
		cout<<"Yes\n";
	}else{
		cout<<"No\n";
	}
//	
	return 0;
}