def main():
    import sys
    input = sys.stdin.read().split()
    idx = 0
    N = int(input[idx]); idx +=1
    A = int(input[idx]); idx +=1
    B = int(input[idx]); idx +=1
    X = int(input[idx]); idx +=1
    Y = int(input[idx]); idx +=1
    H = list(map(int, input[idx:idx+N]))
    
    # Compute prefix sums
    prefix = [0] * N
    prefix[0] = H[0]
    for i in range(1, N):
        prefix[i] = prefix[i-1] + H[i]
    
    for b in range(B + 1):
        max_a = 0
        for i in range(N):
            s = prefix[i]
            temp = s - Y * b
            if temp <= 0:
                required = 0
            else:
                required = (temp + X - 1) // X
            if required > max_a:
                max_a = required
        if max_a <= A:
            print("Yes")
            return
    print("No")

if __name__ == "__main__":
    main()