#include <bits/stdc++.h>
#define rep(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 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,0,n) cin >> H[i];
	sort(all(H),greater<int>());

	int ca = a,cb = b;
	rep(i,0,n){
		while(ca && H[i] > 0){
			H[i] -= x;
			ca--;
		}
	}
	rep(i,0,n){
		if(cb){
			int p = y;
			rep(j,0,n){
				if(H[j] <= 0) continue;
				else {
					int d = min(p,H[j]);
					H[j] -= d;
					p -= d;
				}
			}
			cb--;
		}
	}
	bool ok = true;
	rep(i,0,n){
		if(H[i] > 0) ok = false;
	}
	cout << (ok ? "Yes" : "No");
}