#include #include #define rep(i,n) for(int i = 0; i < n; i++) #define srep(i,a,b) for(int i = a; i < b; i++) #define all(A) (A).begin(),A.end() #define MOD 1000000007 using namespace std; using ll = long long; using P = pair; using Graph = vector>; int main(void){ int N,A,B,X,Y; cin >> N >> A >> B >> X >> Y; vector H(N); int M = 0,p = 0; rep(i,N){ cin >> H[i]; if(M < H[i]) M = H[i],p = i; } while(A){ A--; H[p] -= X; } int P = Y; rep(i,B){ rep(j,N){ if(H[j] <= 0) continue; else { int D = min(P,H[j]); H[j] -= D; P -= D; } } } bool ok = 1; rep(i,N) if(H[i] > 0) ok = 0; cout << (ok ? "Yes" : "No"); }