#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)

using std::cin;
using std::cout;
using std::vector;
using std::priority_queue;
using ll = long long;

int main() {
	int n, a, b, x, y;
	cin >> n >> a >> b >> x >> y;
	
	vector<int> h(n);
	rep(i, n) cin >> h[i];
	
	priority_queue<int> q;
	rep(i, n) q.push(h[i]);
	
	rep(i, a) {
		if (q.size()) {
			int u = q.top(); q.pop();
			if (u > x) q.push(u-x);
		}
	}
	
	ll s = 0;
	while (q.size()) {
		s += q.top();
		q.pop();
	}

	if ((ll)b*y >= s) puts("Yes");
	else puts("No");
	
	return 0;
}