#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()

int main(){
    ll n,a,b,x,y;
    cin >> n >> a >> b >> x >> y;
    priority_queue<ll> h;
    rep(i,n){
        ll z;
        cin >> z;
        h.push(z);
    }
    rep(i,a){
        ll hmax = h.top() - x;
        h.pop();
        if(hmax>0) h.push(hmax);
    }
    ll tot = 0;
    while(h.size()){
        tot += h.top();
        h.pop();
    }
    if(tot <= b*y) cout << "Yes" << endl;
    else cout << "No" << endl;
    return 0;
}