#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <climits>

#define rep(i, n) for(int i = 0; i < n; i++)
#define per(i, n) for(int i = n - 1; i >= 0; i--)
using ll = long long;
#define vi vector<int>
#define vvi vector<vi>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define mod 1000000007
using namespace std;
template<class T, class U>
bool chmax(T &a, const U &b){ return a < b ? (a = b, 1) : 0; }
template<class T, class U>
bool chmin(T &a, const U &b){ return a > b ? (a = b, 1) : 0; }
int main(){
  ll n,a,b,x,y;
  cin >> n >> a >> b >> x >> y;
  vl h(n);
  rep(i, n) cin >> h[i];
  priority_queue<int> que;
  rep(i, n) que.push(h[i]);
  rep(i, a){
    int v = que.top();
    que.pop();
    v -= x;
    que.push(v);
  }
  ll tot = 0;
  rep(i, n){
    int v = que.top();
    que.pop();
    tot += max(0, v);
  }
  if(b*y < tot) cout << "No\n";
  else cout << "Yes\n";
}