#include <bits/stdc++.h>
#include <string.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define srep(i,a,b) for(int i = a; i < b; i++)
#define all(A) (A).begin(),A.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;

int main(void){
	int N,A,B,X,Y; cin >> N >> A >> B >> X >> Y;
	vector<int> H(N); rep(i,N) cin >> H[i];
	vector<P> S(N); rep(i,N) S[i].first = H[i],S[i].second = i;
	sort(all(S),greater<P>());

	int p = 0;
	while(A > 0 && p < N){
		if(S[p].first <= 0) p++;
		if(p == N) break;
		A--;
		S[p].first -= X;
	}
	rep(i,N) H[S[i].second] = S[i].first;

	rep(i,B){
		int P = Y;
		rep(j,N){
			if(H[j] <= 0) continue;
			else {
				int D = min(P,H[j]);
				P -= D; H[j] -= D;
			}
		}
	}

	bool ok = 1;
	rep(i,N) if(H[i] > 0) ok = 0;
	cout << (ok ? "Yes" : "No");
}