#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    int A,B; cin >> A >> B;
    int X,Y; cin >> X >> Y;
    vector<int> h(n);
    for(int i=0;i<n;i++){
        cin >> h[i];
        int m = min(A,h[i]/X);
        A -= m;
        h[i] -= m*X;
    }
    sort(h.rbegin(), h.rend());
    ll sum = 0;
    for(int i=0;i<n;i++){
        if(A > 0){
            A--;
            h[i] = 0;
        }
        sum += h[i];
    }
    if(sum <= (ll)B*(ll)Y){
        cout << "Yes" << endl;
    }
    else{
        cout << "No" << endl;
    }
}