num_n = int(input())
n = map(int, raw_input().split())
num_m = int(input())
m = map(int, raw_input().split())
    
def solve(i, m):
   if m == 0:
      return True
   if i >= num_n or m > sum(n):
      return False
   res = solve(i + 1, m) or solve(i + 1,m - n[i])
   return res
     
for k in range(num_m):
   if solve(0, m[k]):
      print "yes"
   else:
      print "no" num_n = int(input()) num_n int(input()) int input() input n = map(int, raw_input().split()) n map(int, raw_input().split()) map int raw_input().split() ().split () raw_input split num_m = int(input()) num_m int(input()) int input() input m = map(int, raw_input().split()) m map(int, raw_input().split()) map int raw_input().split() ().split () raw_input split def solve(i, m):
   if m == 0:
      return True
   if i >= num_n or m > sum(n):
      return False
   res = solve(i + 1, m) or solve(i + 1,m - n[i])
   return res
      solve if m == 0:
      return True
    m == 0 m 0 return True True if i >= num_n or m > sum(n):
      return False
    i >= num_n or m > sum(n) i >= num_n i num_n m > sum(n) m sum(n) sum n return False False res = solve(i + 1, m) or solve(i + 1,m - n[i]) res solve(i + 1, m) or solve(i + 1,m - n[i]) solve(i + 1, m) solve i + 1 i 1 m solve(i + 1,m - n[i]) solve i + 1 i 1 m - n[i] m n[i] n i return res res i i m m for k in range(num_m):
   if solve(0, m[k]):
      print "yes"
   else:
      print "no" k range(num_m) range num_m if solve(0, m[k]):
      print "yes"
   else:
      print "no" solve(0, m[k]) solve 0 m[k] m k print print n = map(int, raw_input().split()) map(int, raw_input().split()) n def solve(i, m):
   if m == 0:
      return True
   if i >= num_n or m > sum(n):
      return False
   res = solve(i + 1, m) or solve(i + 1,m - n[i])
   return res
      def solve(i, m):
   if m == 0:
      return True
   if i >= num_n or m > sum(n):
      return False
   res = solve(i + 1, m) or solve(i + 1,m - n[i])
   return res
      solve m = map(int, raw_input().split()) map(int, raw_input().split()) m num_n = int(input()) int(input()) num_n num_m = int(input()) int(input()) num_m
num_n = int(input())
n = map(int, raw_input().split())
num_m = int(input())
m = map(int, raw_input().split())
    
def solve(i, m):
   if m == 0:
      return True
   if i >= num_n or m > sum(n):
      return False
   res = solve(i + 1, m) or solve(i + 1,m - n[i])
   return res
     
for k in range(num_m):
   if solve(0, m[k]):
      print "yes"
   else:
      print "no"