import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
#sys.set_int_max_str_digits(10**9)

N,K=map(int,readline().split())
A=list(map(int,readline().split()))
ans="No"
if K in A:
    ans="Yes"
else:
    n=N//2
    se=set()
    for tpl in itertools.product((-1,0,1),repeat=n):
        bit0=0
        s0=0
        for a,i in zip(A[:n],tpl):
            if i==-1:
                bit0|=1
            elif i==1:
                bit0|=2
            s0+=a*i
        se.add((s0,bit0))
    for tpl in itertools.product((-1,0,1),repeat=N-n):
        bit1=0
        s1=0
        for a,i in zip(A[n:],tpl):
            if i==-1:
                bit1|=1
            elif i==1:
                bit1|=2
            s1+=a*i
        s0=K-s1
        for bit0 in range(4):
            if bit0|bit1==3 and (s0,bit0) in se:
                ans="Yes"
print(ans)