#include <bits/stdc++.h>
using namespace std;
int main(){
    int N;
    cin >> N;
    long long A, B, X, Y;
    cin >> A >> B >> X >> Y;
    vector<long long> H(N);
    for(int i = 0; i < N; i++) cin >> H[i];
    vector<int> ind(N);
    iota(ind.begin(), ind.end(), 0);
    priority_queue<long long> q;
    for(int i = 0; i < N; i++) q.push(H[i]);
    while(!q.empty() && A > 0){
        long long temp = q.top();
        q.pop();
        int cnt = min(temp / X, A);
        if(cnt == 0) cnt++;
        temp -= X * cnt;
        if(temp > 0) q.push(temp);
        A -= cnt;
    }
    long long sum = 0;
    while(!q.empty()){
        sum += q.top();
        q.pop();
    }
    if(sum <= B * Y) cout << "Yes" << endl;
    else cout << "No" << endl;
}