import sys
sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
import pypyjit
pypyjit.set_param('max_unroll_recursion=-1')
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd

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

dp = [[0]*(1010) for i in range(n+1)]
a = list(map(int,input().split()))
dp[0][l] = 1
for i in range(1, n+1):
  for j in range(1010):
    dp[i][j] |= dp[i-1][j]
    dp[i][(j+a[i-1])//2] |= dp[i-1][j]
  
print('Yes') if dp[-1][m] else print('No')