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

a = [[0 for j in range(max(m) + 1)] for i in range(n)]

for i in range(n):
    for j in range(max(m) + 1):
        if (i == 0):
            temp = A[i]
            if (temp <= j):
                a[i][j] = temp
            else:
                a[i][j] = 0
        else:
            temp1 = 0
            temp2 = 0
            if (j - A[i] >= 0):
                temp1 = a[i-1][j - A[i]] + A[i]
            temp2 = a[i-1][j]
            a[i][j] = max(temp1, temp2)

for i in range(q):
    if (a[n-1][m[i]] == m[i]):
        print "yes"
    else:
        print "no" n = input() n input() input A = map(int, raw_input().split()) A map(int, raw_input().split()) map int raw_input().split() ().split () raw_input split q = input() q input() input m = map(int, raw_input().split()) m map(int, raw_input().split()) map int raw_input().split() ().split () raw_input split [0 for j in range(max(m) + 1)] for i in range(n) for i in range(n) i range(n) range n for i in range(n) [0 for j in range(max(m) + 1)] a = [[0 for j in range(max(m) + 1)] for i in range(n)] a [[0 for j in range(max(m) + 1)] for i in range(n)] for i in range(n):
    for j in range(max(m) + 1):
        if (i == 0):
            temp = A[i]
            if (temp <= j):
                a[i][j] = temp
            else:
                a[i][j] = 0
        else:
            temp1 = 0
            temp2 = 0
            if (j - A[i] >= 0):
                temp1 = a[i-1][j - A[i]] + A[i]
            temp2 = a[i-1][j]
            a[i][j] = max(temp1, temp2) i range(n) range n for j in range(max(m) + 1):
        if (i == 0):
            temp = A[i]
            if (temp <= j):
                a[i][j] = temp
            else:
                a[i][j] = 0
        else:
            temp1 = 0
            temp2 = 0
            if (j - A[i] >= 0):
                temp1 = a[i-1][j - A[i]] + A[i]
            temp2 = a[i-1][j]
            a[i][j] = max(temp1, temp2) j range(max(m) + 1) range max(m) + 1 max(m) max m 1 if (i == 0):
            temp = A[i]
            if (temp <= j):
                a[i][j] = temp
            else:
                a[i][j] = 0
        else:
            temp1 = 0
            temp2 = 0
            if (j - A[i] >= 0):
                temp1 = a[i-1][j - A[i]] + A[i]
            temp2 = a[i-1][j]
            a[i][j] = max(temp1, temp2) i == 0 i 0 temp = A[i] temp A[i] A i if (temp <= j):
                a[i][j] = temp
            else:
                a[i][j] = 0
         temp <= j temp j a[i][j] = temp a[i][j] [i] a i j temp a[i][j] = 0 a[i][j] [i] a i j 0 temp1 = 0 temp1 0 temp2 = 0 temp2 0 if (j - A[i] >= 0):
                temp1 = a[i-1][j - A[i]] + A[i]
             j - A[i] >= 0 j - A[i] j A[i] A i 0 temp1 = a[i-1][j - A[i]] + A[i] temp1 a[i-1][j - A[i]] + A[i] a[i-1][j - A[i]] [i-1] a i-1 i 1 j - A[i] j A[i] A i A[i] A i temp2 = a[i-1][j] temp2 a[i-1][j] [i-1] a i-1 i 1 j a[i][j] = max(temp1, temp2) a[i][j] [i] a i j max(temp1, temp2) max temp1 temp2 for i in range(q):
    if (a[n-1][m[i]] == m[i]):
        print "yes"
    else:
        print "no" i range(q) range q if (a[n-1][m[i]] == m[i]):
        print "yes"
    else:
        print "no" a[n-1][m[i]] == m[i] a[n-1][m[i]] [n-1] a n-1 n 1 m[i] m i m[i] m i print print n = input() input() n temp2 = 0 0 temp2 a = [[0 for j in range(max(m) + 1)] for i in range(n)] [[0 for j in range(max(m) + 1)] for i in range(n)] a m = map(int, raw_input().split()) map(int, raw_input().split()) m temp = A[i] A[i] temp temp1 = a[i-1][j - A[i]] + A[i] a[i-1][j - A[i]] + A[i] temp1 temp2 = a[i-1][j] a[i-1][j] temp2 temp1 = 0 0 temp1 A = map(int, raw_input().split()) map(int, raw_input().split()) A q = input() input() q
n = input()
A = map(int, raw_input().split())
q = input()
m = map(int, raw_input().split())

a = [[0 for j in range(max(m) + 1)] for i in range(n)]

for i in range(n):
    for j in range(max(m) + 1):
        if (i == 0):
            temp = A[i]
            if (temp <= j):
                a[i][j] = temp
            else:
                a[i][j] = 0
        else:
            temp1 = 0
            temp2 = 0
            if (j - A[i] >= 0):
                temp1 = a[i-1][j - A[i]] + A[i]
            temp2 = a[i-1][j]
            a[i][j] = max(temp1, temp2)

for i in range(q):
    if (a[n-1][m[i]] == m[i]):
        print "yes"
    else:
        print "no"