#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
int main(){
    long long n,a,b,x,y;cin>>n>>a>>b>>x>>y;
    priority_queue<long long,vector<long long>> A;
    for(int i = 0; n > i; i++){
        long long t;cin>>t;
        A.push(t);
    }
    while(a){
        auto z = A.top();A.pop();
        if(z > x){
            A.push(z-x);
        }
        a--;
    }
    long long size = 0;
    while(A.size()){
        auto z = A.top();A.pop();
        size+=z;
    }
    //cout << size << endl;
    if(size > b*y){
        cout << "No" << endl;
    }else{
        cout << "Yes" << endl;
    }
    

}