n,m,l=map(int,input().split())
a=list(map(int,input().split()))

memo=[None]*102
for i in range(102):
    row = list()
    row.append(-1)
    memo[i] = row*1002

def dp(i,x):
    if(memo[i][x]>=0):
        return memo[i][x]
    if i==n:
        if x==m:
            memo[i][x]=1
        else:
            memo[i][x]=0
        return memo[i][x]
    nx = (x+a[i])//2
    ans = dp(i+1,nx) + dp(i+1,x)
    memo[i][x]= min(ans,1)
    return memo[i][x]

print("Yes" if dp(0,l) > 0 else "No")