N, K = gets.split.map(&:to_i)
A = gets.split.map(&:to_i)

def dfs(i, e, sum, memo)
  if i == e
    memo[sum] = true
  else
    dfs(i + 1, e, sum - A[i], memo)
    dfs(i + 1, e, sum, memo)
    dfs(i + 1, e, sum + A[i], memo)
  end
end

memo1 = Hash.new
memo2 = Hash.new

mid = N / 2
dfs(0, mid, 0, memo1)
dfs(mid, N, 0, memo2)

if memo1[K] || memo2[K]
  puts 'Yes'
  exit
else
  memo1.each_key do |k|
    if memo2[K - k] || memo2[k - K]
      puts 'Yes'
      exit
    end
  end
end

puts 'No'