n = int(input())
A = list(map(int,input().split()))
m = int(input())
B = list(map(int,input().split()))

max = 2000

def solve(x,y):
    if x==n:
        S[y] = 1
    else:
        solve(x+1,y)
        if y+A[x] < max+1:
            solve(x+1,y+A[x])
            
S = [0 for i in range(max+1)]

solve(0,0)
    
for i in range(m):
    if S[B[i]] == 1:
        print("yes")
    else:
        print("no")
 n = int(input()) n int(input()) int input() input A = list(map(int,input().split())) A list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split m = int(input()) m int(input()) int input() input B = list(map(int,input().split())) B list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split max = 2000 max 2000 def solve(x,y):
    if x==n:
        S[y] = 1
    else:
        solve(x+1,y)
        if y+A[x] < max+1:
            solve(x+1,y+A[x])
             solve if x==n:
        S[y] = 1
    else:
        solve(x+1,y)
        if y+A[x] < max+1:
            solve(x+1,y+A[x])
             x==n x n S[y] = 1 S[y] S y 1 solve(x+1,y) solve x+1 x 1 y if y+A[x] < max+1:
            solve(x+1,y+A[x])
             y+A[x] < max+1 y+A[x] y A[x] A x max+1 max 1 solve(x+1,y+A[x]) solve x+1 x 1 y+A[x] y A[x] A x x x y y 0 for i in range(max+1) for i in range(max+1) i range(max+1) range max+1 max 1 for i in range(max+1) 0 S = [0 for i in range(max+1)] S [0 for i in range(max+1)] solve(0,0) solve 0 0 for i in range(m):
    if S[B[i]] == 1:
        print("yes")
    else:
        print("no") i range(m) range m if S[B[i]] == 1:
        print("yes")
    else:
        print("no") S[B[i]] == 1 S[B[i]] S B[i] B i 1 print("yes") print "yes" print("no") print "no" A = list(map(int,input().split())) list(map(int,input().split())) A S = [0 for i in range(max+1)] [0 for i in range(max+1)] S B = list(map(int,input().split())) list(map(int,input().split())) B max = 2000 2000 max n = int(input()) int(input()) n m = int(input()) int(input()) m def solve(x,y):
    if x==n:
        S[y] = 1
    else:
        solve(x+1,y)
        if y+A[x] < max+1:
            solve(x+1,y+A[x])
             def solve(x,y):
    if x==n:
        S[y] = 1
    else:
        solve(x+1,y)
        if y+A[x] < max+1:
            solve(x+1,y+A[x])
             solve
n = int(input())
A = list(map(int,input().split()))
m = int(input())
B = list(map(int,input().split()))

max = 2000

def solve(x,y):
    if x==n:
        S[y] = 1
    else:
        solve(x+1,y)
        if y+A[x] < max+1:
            solve(x+1,y+A[x])
            
S = [0 for i in range(max+1)]

solve(0,0)
    
for i in range(m):
    if S[B[i]] == 1:
        print("yes")
    else:
        print("no")

