import math
from collections import Counter

def main():
    import sys
    input = sys.stdin.read().split()
    idx = 0
    N = int(input[idx])
    idx += 1
    X = int(input[idx])
    idx += 1
    Y = int(input[idx])
    idx += 1
    R = list(map(int, input[idx:idx+N]))
    idx += N

    sum_total = sum(R)
    OP = math.sqrt(X ** 2 + Y ** 2)
    min_r = min(R)
    count = Counter(R)

    for r_last in R:
        candidates = []
        if count[r_last] >= 2:
            candidates.append(r_last)
        if min_r != r_last or count[r_last] >= 2:
            candidates.append(min_r)
        # Remove duplicates
        candidates = list(set(candidates))
        for r_first in candidates:
            if r_first == r_last and count[r_last] < 2:
                continue
            min_D = r_first + r_last
            max_D = 2 * sum_total - r_first - r_last
            lower = OP - r_last
            upper = OP + r_last
            left = max(min_D, lower)
            right = min(max_D, upper)
            if left <= right:
                print("Yes")
                return
    print("No")

if __name__ == "__main__":
    main()