import sys #input = sys.stdin.readline #input = sys.stdin.buffer.readline #文字列はダメ sys.setrecursionlimit(1000000) import math import bisect #import itertools #import random #from heapq import heapify, heappop, heappush from collections import defaultdict from collections import deque #import copy #DeepCopy: hoge = [_[:] for _ in hogehoge] #from functools import lru_cache #@lru_cache(maxsize=None) #MOD = pow(10,9) + 7 MOD = 998244353 #dx = [1,0,-1,0] #dy = [0,1,0,-1] #dx8 = [1,1,0,-1,-1,-1,0,1] #dy8 = [0,1,1,1,0,-1,-1,-1] def main(): N,M,L = map(int,input().split()) A = list(map(int,input().split())) MAX = 1010 # dp[i][j]:i番目まで見て色jができるなら1 dp = [0]*MAX dp[L] = 1 for a in A: p = [0]*MAX dp,p = p,dp dp[a] |= 1 for j in range(MAX): dp[j] |= p[j] #使わない場合 nj = (a + j)//2 dp[nj] |= p[j] # print(dp) if dp[M] == 1: print('Yes') else: print('No') if __name__ == '__main__': main()