#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
using namespace std;

typedef long long ll;

int main() {
    int N, A, B, X, Y, H;
    cin >> N >> A >> B >> X >> Y;
    priority_queue<int> pq;
    rep(i, 0, N) {
        cin >> H;
        pq.push(H);
    }
    rep(i, 0, A) {
        int p = pq.top();
        pq.pop();
        pq.push(max(0, p - X));
    }
    ll S = 0;
    while (!pq.empty()) {
        int p = pq.top();
        pq.pop();
        S += p;
        //cout << "p=" << p << endl;
    }
    if (1LL * Y * B >= S) cout << "Yes\n";
    else cout << "No\n";
}