#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; int N,A,B,X,Y,H[3000]; void solve() { cin >> N >> A >> B >> X >> Y; priority_queue> Q; for(int i = 0;i < N;i++) cin >> H[i],Q.push(make_pair(H[i],i)); while(A--) { auto [h,i] = Q.top(); Q.pop(); H[i] -= X; Q.push(make_pair(H[i],i)); } while(B--) { int P = Y; for(int i = 0;i < N;i++) { if(H[i] >= 0) { int D = min(P,H[i]); H[i] -= D,P -= D; } } } for(int i = 0;i < N;i++) if(H[i] > 0) { cout << "No" << endl; return; } cout << "Yes" << endl; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int tt = 1; //cin >> tt; while(tt--) solve(); }