N,M,L = map(int,input().split())
A = [0]+list(map(int,input().split()))
amax = max(A)
X = max(L,M,amax)
dp = [[False for _ in range(X+1)] for _ in range(N+1)]
dp[1][L] = True
dp[1][A[1]] = True
dp[1][(L+A[1])//2] = True
for i in range(2,N+1):
    for j in range(X+1):
        dp[i][j] = dp[i-1][j]
        if 0<=2*j-A[i]<=X:
            dp[i][j] = dp[i][j]|dp[i-1][2*j-A[i]]
if dp[N][M]:
    print("Yes")
else:
    print("No")