N, M, L = map(int,input().split())
A = [0] + list(map(int,input().split()))
#dp[i][j] = i番目の色までで色jを作ることが出来るか
dp = [[0 for x in range(1010)] for y in range(110)]
dp[0][L] = 1
for x in range(1, N + 1):
  for y in range(1010):
    dp[x][y] = max(dp[x][y], dp[x-1][y])
    if dp[x-1][y] == 1:
      C = (y + A[x]) // 2
      dp[x][C] = 1
if dp[N][M] == 1:
  print("Yes")
else:
  print("No")