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

max = max(m)

dp = [[0 for _ in range(max + 1)] for __ in range(n + 1)]
dp[0][0] = 1#[1 for _ in range(max + 1)]
for j in range(n):
  for k in range(max + 1):
    if k >= A[j] and dp[j][k - A[j]]:
      dp[j + 1][k] = 1
    elif dp[j][k]:
      dp[j + 1][k] = 1
for i in range(q):
  if dp[n][m[i]]:
     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 = max(m) max max(m) max m [0 for _ in range(max + 1)] for __ in range(n + 1) for __ in range(n + 1) __ range(n + 1) range n + 1 n 1 for __ in range(n + 1) [0 for _ in range(max + 1)] dp = [[0 for _ in range(max + 1)] for __ in range(n + 1)] dp [[0 for _ in range(max + 1)] for __ in range(n + 1)] dp[0][0] = 1 dp[0][0] [0] dp 0 0 1 for j in range(n):
  for k in range(max + 1):
    if k >= A[j] and dp[j][k - A[j]]:
      dp[j + 1][k] = 1
    elif dp[j][k]:
      dp[j + 1][k] = 1 j range(n) range n for k in range(max + 1):
    if k >= A[j] and dp[j][k - A[j]]:
      dp[j + 1][k] = 1
    elif dp[j][k]:
      dp[j + 1][k] = 1 k range(max + 1) range max + 1 max 1 if k >= A[j] and dp[j][k - A[j]]:
      dp[j + 1][k] = 1
    elif dp[j][k]:
      dp[j + 1][k] = 1 k >= A[j] and dp[j][k - A[j]] k >= A[j] k A[j] A j dp[j][k - A[j]] [j] dp j k - A[j] k A[j] A j dp[j + 1][k] = 1 dp[j + 1][k] [j + 1] dp j + 1 j 1 k 1 elif dp[j][k]:
      dp[j + 1][k] = 1 dp[j][k] [j] dp j k dp[j + 1][k] = 1 dp[j + 1][k] [j + 1] dp j + 1 j 1 k 1 for i in range(q):
  if dp[n][m[i]]:
     print("yes")
  else:
    print("no") i range(q) range q if dp[n][m[i]]:
     print("yes")
  else:
    print("no") dp[n][m[i]] [n] dp n m[i] m i print("yes") print "yes" print("no") print "no" m = list(map(int, input().split())) list(map(int, input().split())) m q = int(input()) int(input()) q n = int(input()) int(input()) n A = list(map(int, input().split())) list(map(int, input().split())) A max = max(m) max(m) max dp = [[0 for _ in range(max + 1)] for __ in range(n + 1)] [[0 for _ in range(max + 1)] for __ in range(n + 1)] dp
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))

max = max(m)

dp = [[0 for _ in range(max + 1)] for __ in range(n + 1)]
dp[0][0] = 1#[1 for _ in range(max + 1)]
for j in range(n):
  for k in range(max + 1):
    if k >= A[j] and dp[j][k - A[j]]:
      dp[j + 1][k] = 1
    elif dp[j][k]:
      dp[j + 1][k] = 1
for i in range(q):
  if dp[n][m[i]]:
     print("yes")
  else:
    print("no")
