def solve(pos, tot, A):
    if tot == 0: return True
    if pos > len(A) - 1: return False

    return solve(pos+1, tot - A[pos], A) or \
           solve(pos+1, tot, A)

n = raw_input()
b = map(int, raw_input().split())
n = raw_input()
t = map(int, raw_input().split())

max = sum(b) + 1
for tt in t:
    print 'yes' if tt < max and True == solve(0, tt, b) else 'no' def solve(pos, tot, A):
    if tot == 0: return True
    if pos > len(A) - 1: return False

    return solve(pos+1, tot - A[pos], A) or \
           solve(pos+1, tot, A) solve if tot == 0: return True
     tot == 0 tot 0 if pos > len(A) - 1: return False

     pos > len(A) - 1 pos len(A) - 1 len(A) len A 1 return solve(pos+1, tot - A[pos], A) or \
           solve(pos+1, tot, A) solve(pos+1, tot - A[pos], A) or \
           solve(pos+1, tot, A) solve(pos+1, tot - A[pos], A) solve pos+1 pos 1 tot - A[pos] tot A[pos] A pos A solve(pos+1, tot, A) solve pos+1 pos 1 tot A pos pos tot tot A A n = raw_input() n raw_input() raw_input b = map(int, raw_input().split()) b map(int, raw_input().split()) map int raw_input().split() ().split () raw_input split n = raw_input() n raw_input() raw_input t = map(int, raw_input().split()) t map(int, raw_input().split()) map int raw_input().split() ().split () raw_input split max = sum(b) + 1 max sum(b) + 1 sum(b) sum b 1 for tt in t:
    print 'yes' if tt < max and True == solve(0, tt, b) else 'no' tt t print 'yes' if tt < max and True == solve(0, tt, b) else 'no' tt < max and True == solve(0, tt, b) tt < max tt max True == solve(0, tt, b) True solve(0, tt, b) solve 0 tt b 'yes' 'no' b = map(int, raw_input().split()) map(int, raw_input().split()) b n = raw_input() raw_input() n t = map(int, raw_input().split()) map(int, raw_input().split()) t max = sum(b) + 1 sum(b) + 1 max n = raw_input() raw_input() n def solve(pos, tot, A):
    if tot == 0: return True
    if pos > len(A) - 1: return False

    return solve(pos+1, tot - A[pos], A) or \
           solve(pos+1, tot, A) def solve(pos, tot, A):
    if tot == 0: return True
    if pos > len(A) - 1: return False

    return solve(pos+1, tot - A[pos], A) or \
           solve(pos+1, tot, A) solve
def solve(pos, tot, A):
    if tot == 0: return True
    if pos > len(A) - 1: return False

    return solve(pos+1, tot - A[pos], A) or \
           solve(pos+1, tot, A)

n = raw_input()
b = map(int, raw_input().split())
n = raw_input()
t = map(int, raw_input().split())

max = sum(b) + 1
for tt in t:
    print 'yes' if tt < max and True == solve(0, tt, b) else 'no'