#include <iostream>
#include <fstream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cmath>
#include <unordered_map>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <list>
#include <climits>
#include <bitset>
#include <numeric>
#include <cassert>
#include <regex>
using std::cout;
using std::cin;
using std::string;
using std::vector;

int main()
{
    int n, a, b;
    cin >> n >> a >> b;
    long long x, y;
    cin >> x >> y;
    std::priority_queue<long long> arr;
    long long total_health = 0;
    for (int i = 0; i < n; i++)
    {
        long long health;
        cin >> health;
        arr.push(health);
        total_health += health;
    }
    long long a_damage = 0;
    while (a > 0)
    {
        a_damage += std::min(arr.top(), x);
        long long new_health = arr.top() - std::min(arr.top(), x);
        arr.pop();
        arr.push(new_health);
        a--;
    }
    if (a_damage >= total_health - b * y)
    {
        cout << "Yes";
    }
    else
    {
        cout << "No";
    }
}