from bisect import bisect_right
from itertools import accumulate
from math import ceil


def main():
    N, A, B, X, Y = map(int, input().split())
    H = list(map(int, input().split()))
    H_partial_sum = list(accumulate(H))
    used_num_of_magic_A = list(map(lambda num: ceil(num // X), H))
    sum_used_num_of_magic_A_reversed = list(accumulate(
        reversed(used_num_of_magic_A)))

    magic_B_kill_idx = bisect_right(H_partial_sum, Y*B)
    magic_A_kill_idx = N - bisect_right(sum_used_num_of_magic_A_reversed, A)

    if magic_B_kill_idx >= magic_A_kill_idx:
        print("Yes")
        return

    if magic_B_kill_idx + 1 < magic_A_kill_idx:
        print("No")
        return
    try:
        magic_B_rest = Y*B - H_partial_sum[magic_B_kill_idx-1]
    except IndexError:
        magic_B_rest = Y*B
    try:
        magic_A_rest_num = A - used_num_of_magic_A[N - magic_A_kill_idx - 1]
    except IndexError:
        magic_A_rest_num = A

    if magic_B_rest + magic_A_rest_num * X >= H[magic_B_kill_idx]:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()