#include <iostream>
#include <queue>
using namespace std;
typedef long long ll;

int main()
{
    int n, a, b;
    ll x, y;
    cin >> n >> a >> b >> x >> y;
    priority_queue<ll> que;
    for(int i = 0; i < n; i++){
        ll h;
        cin >> h;
        que.push(h);
    }
    for(int i = 0; i < a; i++){
        ll u = que.top();
        que.pop();
        u = max(0ll, u - x);
        que.push(u);
    }
    ll s = 0;
    while(que.size()){
        s += que.top();
        que.pop();
    }
    if(s > b * y) cout << "No" << endl;
    else cout << "Yes" << endl;
}