def solve():
    N,M,L=map(int,input().split())
    A=list(map(int,input().split()))

    K=max(M,L,max(A))
    DP=[0]*(K+1); DP[L]=1
    for a in A:
        E=DP.copy()
        for c in range(K+1):
            DP[(c+a)//2]|=E[c]
    return DP[M]

#==================================================
print("Yes" if solve() else "No")