#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<string>
#include<iomanip>
#include<numeric>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
const int mod=998244353;
int main(){
	int n,a,b,x,y,h[3000];
	cin>>n>>a>>b>>x>>y;
	for(int i=0;i<n;i++){
		cin>>h[i];
		int tmp=min(h[i]/x,a);
		h[i]-=tmp*x;
		a-=tmp;
	}
	sort(h,h+n,greater<>());
	for(int i=0;i<min(n,a);i++)
		h[i]=0;
	ll sum=accumulate(h,h+n,0ll);
	cout<<((sum+y-1)/y<=b?"Yes":"No")<<endl;
}