// code of JUYU ^ ^ never doubt youself !
#include <bits/stdc++.h>
typedef long long ll;
#define int ll
#define For(i,a,b) for (int i = a; i <= b; i ++)
#define Dow(i,a,b) for (int i = b; i >= a; -- i)
#define ms(a,b) memset(a, b, sizeof (a))
#define fir first
#define sec second
#define mk make_pair
#define pb push_back
#define eb emplace_back
using namespace std;
typedef pair<int,int> PII;

const int mod = 998244353;
const int MOD = 1000000007;
const int maxn = 3005;

inline ll read()
{
  ll t = 0, dp = 1; char c = getchar();
  while(!isdigit(c)) {if (c == '-') dp = -1; c = getchar();}
  while(isdigit(c)) t = t * 10 + c - 48, c = getchar();
  return t * dp;
}
inline void write(ll x){if (x < 0){putchar('-'); x = -x;} if(x >= 10) write(x / 10); putchar(x % 10 + 48);}
inline void writeln(ll x){write(x); puts("");}
inline void write_p(ll x){write(x); putchar(' ');}
inline void write_b(ll x){putchar(' '); write(x);}
inline int qpow(int x, int y, int z){int ret = 1; for (; y; y /= 2, x = x * x % z) if (y & 1) ret = ret * x % z; return ret;}
inline int PrimeInv(int x, int y, int z){return qpow(x, y - 2, z);}

int H[maxn], N, A, B, X, Y;

inline bool check(int x)
{
  int ret = 0;
  For(i,1,N)
  {
    int t = max(0LL, (H[i] - x) / X);
    if (H[i] - t * X > x) t ++;
    ret += t;
  }
  return ret <= A;
}

signed main()
{
  N = read(), A = read(), B = read(), X = read(), Y = read();
  For(i,1,N) H[i] = read();
  int l = -1, r = 1e9 + 1, x = -1;
  while (l + 1 != r)
  {
    int mid = (l + r) / 2;
    if (check(mid)) x = r = mid;
    else l = mid;
  }
  For(i,1,N)
  {
    if (H[i] > x)
    {
      int t = max(0LL, (H[i] - x) / X);
      if (H[i] - t * X > x) t ++;
      if (A >= t)
      {
        H[i] -= t * X;
        A -= t;
      }
    }
    H[i] = max(0LL, H[i]);
  }
  int sum = 0;
  For(i,1,N) sum += H[i];
  puts((sum + Y - 1) / Y <= B ? "Yes" : "No");
  
  return 0;
}

/* stuff you should look for
 * int overflow, array bounds
 * special cases (n=1?)
 * do smth instead of nothing and stay organized
 * WRITE STUFF DOWN
 * DON'T GET STUCK ON ONE APPROACH
 -- Benq
*/