import sys

def exhaustiveSearch(A, m, i, s):
    if A[i] == m:
        return True
    elif i == len(A) - 1 or m < 0 or m > s:
        return False

    return exhaustiveSearch(A, m, i + 1, s) or exhaustiveSearch(A, m - A[i], i + 1, s)

if __name__ == "__main__":
    lines = sys.stdin.readlines()
    A = map(int, lines[1].split())
    M = map(int, lines[3].split())
    s = sum(A)

    for m in M:
        if exhaustiveSearch(A, m, 0, s):
            print "yes"
        else:
            print "no" import sys sys def exhaustiveSearch(A, m, i, s):
    if A[i] == m:
        return True
    elif i == len(A) - 1 or m < 0 or m > s:
        return False

    return exhaustiveSearch(A, m, i + 1, s) or exhaustiveSearch(A, m - A[i], i + 1, s) exhaustiveSearch if A[i] == m:
        return True
    elif i == len(A) - 1 or m < 0 or m > s:
        return False

     A[i] == m A[i] A i m return True True elif i == len(A) - 1 or m < 0 or m > s:
        return False

     i == len(A) - 1 or m < 0 or m > s i == len(A) - 1 or m < 0 i == len(A) - 1 i len(A) - 1 len(A) len A 1 m < 0 m 0 m > s m s return False False return exhaustiveSearch(A, m, i + 1, s) or exhaustiveSearch(A, m - A[i], i + 1, s) exhaustiveSearch(A, m, i + 1, s) or exhaustiveSearch(A, m - A[i], i + 1, s) exhaustiveSearch(A, m, i + 1, s) exhaustiveSearch A m i + 1 i 1 s exhaustiveSearch(A, m - A[i], i + 1, s) exhaustiveSearch A m - A[i] m A[i] A i i + 1 i 1 s A A m m i i s s if __name__ == "__main__":
    lines = sys.stdin.readlines()
    A = map(int, lines[1].split())
    M = map(int, lines[3].split())
    s = sum(A)

    for m in M:
        if exhaustiveSearch(A, m, 0, s):
            print "yes"
        else:
            print "no" __name__ == "__main__" __name__ "__main__" lines = sys.stdin.readlines() lines sys.stdin.readlines() sys.stdin.readlines sys.stdin sys stdin readlines A = map(int, lines[1].split()) A map(int, lines[1].split()) map int lines[1].split() [1].split [1] lines 1 split M = map(int, lines[3].split()) M map(int, lines[3].split()) map int lines[3].split() [3].split [3] lines 3 split s = sum(A) s sum(A) sum A for m in M:
        if exhaustiveSearch(A, m, 0, s):
            print "yes"
        else:
            print "no" m M if exhaustiveSearch(A, m, 0, s):
            print "yes"
        else:
            print "no" exhaustiveSearch(A, m, 0, s) exhaustiveSearch A m 0 s print print def exhaustiveSearch(A, m, i, s):
    if A[i] == m:
        return True
    elif i == len(A) - 1 or m < 0 or m > s:
        return False

    return exhaustiveSearch(A, m, i + 1, s) or exhaustiveSearch(A, m - A[i], i + 1, s) def exhaustiveSearch(A, m, i, s):
    if A[i] == m:
        return True
    elif i == len(A) - 1 or m < 0 or m > s:
        return False

    return exhaustiveSearch(A, m, i + 1, s) or exhaustiveSearch(A, m - A[i], i + 1, s) exhaustiveSearch s = sum(A) sum(A) s lines = sys.stdin.readlines() sys.stdin.readlines() lines A = map(int, lines[1].split()) map(int, lines[1].split()) A M = map(int, lines[3].split()) map(int, lines[3].split()) M
import sys

def exhaustiveSearch(A, m, i, s):
    if A[i] == m:
        return True
    elif i == len(A) - 1 or m < 0 or m > s:
        return False

    return exhaustiveSearch(A, m, i + 1, s) or exhaustiveSearch(A, m - A[i], i + 1, s)

if __name__ == "__main__":
    lines = sys.stdin.readlines()
    A = map(int, lines[1].split())
    M = map(int, lines[3].split())
    s = sum(A)

    for m in M:
        if exhaustiveSearch(A, m, 0, s):
            print "yes"
        else:
            print "no"