# LDS1_5_A

def solve(target, sum, idx, arr)
  return true if sum == target
  return false if sum > target || idx >= arr.size

  solve(target, sum + arr[idx], idx + 1, arr) ||
    solve(target, sum, idx + 1, arr)
end

_n = gets.to_i
nums = gets.split.map(&:to_i).reverse
_q = gets.to_i
targets = gets.split.map(&:to_i)

targets.each do |target|
  puts solve(target, 0, 0, nums) ? 'yes' : 'no'
end

