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(s - a)
            add2.add(a - s)
        for s in pm:
            for x in [s + a, s - a, -s + a, -s - a]:
                add2.add(x)

        p |= add
        pm |= add2
    return p, pm
        
p1, pm1 = f(L)
p2, pm2 = f(R)

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

for s in pm1:
    for x in [s + k, s - k, -s + k, -s - k]:
        if x in p2 or x in pm2:
            yes()

for s in p1:
    for x in [s + k, s - k]:
        if x in p2 or x in pm2:
            yes()
    for x in [-s + k, -s - k]:
        if x in pm2:
            yes()
            
no()