def yes():
    print("Yes")
    exit()
    
def no():
    print("No")
    exit()

n, k = map(int, input().split())
A = list(map(int, input().split()))
if k in A:
    yes()
L = A[:n // 2]
R = A[n // 2:]

def f(A):
    pm = set()
    p = set()
    for a in A:
        add = {a}
        for s in p:
            add.add(s + a)
        
        add2 = set()
        for s in p:
            add2.add(abs(s - a))
        for s in pm:
            add2.add(abs(s + a))
            add2.add(abs(s - a))
            
        p |= add
        pm |= add2
    return p, pm
        
p1, pm1 = f(L)
p2, pm2 = f(R)

if k in pm1 or k in pm2:
    yes()

if -k in pm1 or -k in pm2:
    yes()

se1 = p1 | pm1
se2 = p2 | pm2
    
for s in se1:
    for x in [s + k, s - k, -s + k, -s - k]:
        if x in se2:
            yes()
no()