import math

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]))
    
    D = math.hypot(X, Y)
    
    if N == 0:
        print("No")
        return
    
    R_sorted = sorted(R, reverse=True)
    sum_r = sum(R)
    max1 = R_sorted[0]
    max2 = R_sorted[1] if N >= 2 else 0
    
    for r_last in R:
        sum_prev = sum_r - r_last
        if N == 1:
            m_prev = 0
        else:
            if r_last == max1:
                m_prev = max2 if N >= 2 else 0
            else:
                m_prev = max1
        
        a = max(0, 2 * m_prev - sum_prev)
        b = sum_prev
        
        lower = a + (m_prev - r_last)
        upper = b + (m_prev + r_last)
        
        if lower <= D <= upper:
            print("Yes")
            return
    
    print("No")

if __name__ == "__main__":
    main()