n = int(input())
A = list(map(int, input().split(' ')))
q = int(input())
M = list(map(int, input().split(' ')))

# 上限と下限でフィルター
max_A = 0
min_A = float('inf')
for num in A:
    max_A += num
    if num < min_A:
        min_A = num

def rec(i, m):
    if m < 0:
        return False
    elif m == 0:
        return True
    if i >= n:
        return False

    rst = rec(i+1, m - A[i]) or rec(i+1, m)
    return rst

for m in M:
    if m < min_A or max_A < m:
        print('no')
    elif rec(0, m):
        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 ' ' q = int(input()) q int(input()) int input() input M = list(map(int, input().split(' '))) M list(map(int, input().split(' '))) list map(int, input().split(' ')) map int input().split(' ') ().split () input split ' ' max_A = 0 max_A 0 min_A = float('inf') min_A float('inf') float 'inf' for num in A:
    max_A += num
    if num < min_A:
        min_A = num num A max_A += num max_A num if num < min_A:
        min_A = num num < min_A num min_A min_A = num min_A num def rec(i, m):
    if m < 0:
        return False
    elif m == 0:
        return True
    if i >= n:
        return False

    rst = rec(i+1, m - A[i]) or rec(i+1, m)
    return rst rec if m < 0:
        return False
    elif m == 0:
        return True
     m < 0 m 0 return False False elif m == 0:
        return True
     m == 0 m 0 return True True if i >= n:
        return False

     i >= n i n return False False rst = rec(i+1, m - A[i]) or rec(i+1, m) rst rec(i+1, m - A[i]) or rec(i+1, m) rec(i+1, m - A[i]) rec i+1 i 1 m - A[i] m A[i] A i rec(i+1, m) rec i+1 i 1 m return rst rst i i m m for m in M:
    if m < min_A or max_A < m:
        print('no')
    elif rec(0, m):
        print('yes')
    else:
        print('no') m M if m < min_A or max_A < m:
        print('no')
    elif rec(0, m):
        print('yes')
    else:
        print('no') m < min_A or max_A < m m < min_A m min_A max_A < m max_A m print('no') print 'no' elif rec(0, m):
        print('yes')
     rec(0, m) rec 0 m print('yes') print 'yes' print('no') print 'no' min_A = num num min_A A = list(map(int, input().split(' '))) list(map(int, input().split(' '))) A M = list(map(int, input().split(' '))) list(map(int, input().split(' '))) M q = int(input()) int(input()) q min_A = float('inf') float('inf') min_A def rec(i, m):
    if m < 0:
        return False
    elif m == 0:
        return True
    if i >= n:
        return False

    rst = rec(i+1, m - A[i]) or rec(i+1, m)
    return rst def rec(i, m):
    if m < 0:
        return False
    elif m == 0:
        return True
    if i >= n:
        return False

    rst = rec(i+1, m - A[i]) or rec(i+1, m)
    return rst rec n = int(input()) int(input()) n max_A += num num max_A max_A = 0 0 max_A
n = int(input())
A = list(map(int, input().split(' ')))
q = int(input())
M = list(map(int, input().split(' ')))

# 上限と下限でフィルター
max_A = 0
min_A = float('inf')
for num in A:
    max_A += num
    if num < min_A:
        min_A = num

def rec(i, m):
    if m < 0:
        return False
    elif m == 0:
        return True
    if i >= n:
        return False

    rst = rec(i+1, m - A[i]) or rec(i+1, m)
    return rst

for m in M:
    if m < min_A or max_A < m:
        print('no')
    elif rec(0, m):
        print('yes')
    else:
        print('no')

