#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
const int INF = INT_MAX;
const ll LINF = LLONG_MAX;
#define rep(i, s, n) for (int i = (s); i < (int)(n); ++i)
#define repl(i, s, n) for (ll i = (s); i < (ll)(n); ++i)
#define repr(i, s, n) for (int i = (s)-1; i >= (int)(n); --i)
#define vec(type,name,size) vector<type>name(size)
#define vecini(type,name,size,ini) vector<type>name(size,ini)
#define vv(type,name,h,w) vector<vector<type>>name(h,vector<type>(w))
#define vvini(type,name,h,w,ini) vector<vector<type>>name(h,vector<type>(w,ini))
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(),(x).rend()
#define sz(x) ((int)(x).size())
template<class T> bool chmin(T& a, T b){ if(a > b) { a = b; return true; } return false; }
template<class T> bool chmax(T& a, T b){ if(a < b) { a = b; return true; } return false; }

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  
  int n, a, b, x, y; cin >> n >> a >> b >> x >> y;
  vector<int> v(n);
  rep(i, 0, n) {
    cin >> v[i];
  }
  
  int max_idx = 0;
  while(a > 0) {
      int max_idx = 0;
      rep(i, 1, n) {
          if(v[i] > v[max_idx]) max_idx = i;
      }
      if(v[max_idx] <= 0) break;
      v[max_idx] -= x;
      --a;
  }
  
  ll sum = 0;
  rep(i, 0, n) {
      if(v[i] > 0) sum += v[i];
  }
  
  if(sum <= b*y) cout << "Yes" << endl;
  else cout << "No" << endl;
  return 0;
}