def solve(i, j):
    if i == 0:
    	return True
    if j < n and A[0] <= i <= sum(A[j:]):
        x = solve(i-A[j], j+1)
        if x:
        	return x
        y = solve(i, j+1)
        if y:
        	return y

n = input()
A = sorted(map(int, raw_input().split()))
p = input()
m = map(int, raw_input().split())

for k in m:
	if solve(k, 0):
		print "yes"
	else:
		print "no" def solve(i, j):
    if i == 0:
    	return True
    if j < n and A[0] <= i <= sum(A[j:]):
        x = solve(i-A[j], j+1)
        if x:
        	return x
        y = solve(i, j+1)
        if y:
        	return y solve if i == 0:
    	return True
     i == 0 i 0 return True True if j < n and A[0] <= i <= sum(A[j:]):
        x = solve(i-A[j], j+1)
        if x:
        	return x
        y = solve(i, j+1)
        if y:
        	return y j < n and A[0] <= i <= sum(A[j:]) j < n j n A[0] <= i <= sum(A[j:]) A[0] <= i A[0] A 0 i sum(A[j:]) sum A[j:] A j: j x = solve(i-A[j], j+1) x solve(i-A[j], j+1) solve i-A[j] i A[j] A j j+1 j 1 if x:
        	return x
         x return x x y = solve(i, j+1) y solve(i, j+1) solve i j+1 j 1 if y:
        	return y y return y y i i j j n = input() n input() input A = sorted(map(int, raw_input().split())) A sorted(map(int, raw_input().split())) sorted map(int, raw_input().split()) map int raw_input().split() ().split () raw_input split p = input() p input() input m = map(int, raw_input().split()) m map(int, raw_input().split()) map int raw_input().split() ().split () raw_input split for k in m:
	if solve(k, 0):
		print "yes"
	else:
		print "no" k m if solve(k, 0):
		print "yes"
	else:
		print "no" solve(k, 0) solve k 0 print print def solve(i, j):
    if i == 0:
    	return True
    if j < n and A[0] <= i <= sum(A[j:]):
        x = solve(i-A[j], j+1)
        if x:
        	return x
        y = solve(i, j+1)
        if y:
        	return y def solve(i, j):
    if i == 0:
    	return True
    if j < n and A[0] <= i <= sum(A[j:]):
        x = solve(i-A[j], j+1)
        if x:
        	return x
        y = solve(i, j+1)
        if y:
        	return y solve A = sorted(map(int, raw_input().split())) sorted(map(int, raw_input().split())) A n = input() input() n m = map(int, raw_input().split()) map(int, raw_input().split()) m p = input() input() p
def solve(i, j):
    if i == 0:
    	return True
    if j < n and A[0] <= i <= sum(A[j:]):
        x = solve(i-A[j], j+1)
        if x:
        	return x
        y = solve(i, j+1)
        if y:
        	return y

n = input()
A = sorted(map(int, raw_input().split()))
p = input()
m = map(int, raw_input().split())

for k in m:
	if solve(k, 0):
		print "yes"
	else:
		print "no"