#include <bits/stdc++.h>
using namespace std;

int main() {
    int N,A,B,X,Y;
    cin >> N >> A >> B >> X >> Y;
    priority_queue<int>que;
    for(int i = 0; i < N; i++) {
        int H;
        cin >> H;
        que.push(H);
    }
    int p = 0;
    while (!que.empty() && (A || B || p)) {
        int x = que.top();
        que.pop();
        if(A) {
            A--;
            x = max(0,x-X);
            if(x) {
                que.push(x);
            }
        }
        else {
            if(p == 0) {
                p = Y;
                B--;
            }
            int D = min(p,x);
            x -= D;
            p -= D;
            if(x) {
                que.push(x);
            }
        }
    }
    cout << ((que.empty())?"Yes":"No") << endl;
}