output_description: Print `YES` if Rng can complete the problem set without creating new
  candidates of problems; print `NO` if he cannot.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      D_1 D_2 ... D_N
      M
      T_1 T_2 ... T_M
attempt: n = input()
  d = [int(i) for i in input().split(" ")]
  
  m = input()
  t = [int(i) for i in input().split(" ")]
  
  
  d_set = set(d)
  d_set = list(d_set)
  t_set = set(t)
  t_set = list(t_set)
  
  flag =0
  
  if len(t_set != d_set):
      flag = 1
  else:
      for s in t_set:
      if(d.count(s) < t.count(s)):
          flag = 1
          break
  
  
  if flag == 1:
      print("NO")
  else:
      print("YES")
problem_description: Statement
  
  Rng is preparing a problem set for a qualification round of CODEFESTIVAL.
  
  He has N candidates of problems. The difficulty of the i-th candidate is D_i.
  
  There must be M problems in the problem set, and the difficulty of the i-th
  problem must be T_i. Here, one candidate of a problem cannot be used as
  multiple problems.
  
  Determine whether Rng can complete the problem set without creating new
  candidates of problems.
samples: [{"input": "5\n    3 1 4 1 5\n    3\n    5 4 3", "output": "YES\n    \n\n* * *"}, {"input": "7\n    100 200 500 700 1200 1600 2000\n    6\n    100 200 500 700 1600 1600", "output": "NO\n    \n\nNot enough 1600s.\n\n* * *"}, {"input": "1\n    800\n    5\n    100 100 100 100 100", "output": "NO\n    \n\n* * *"}, {"input": "15\n    1 2 2 3 3 3 4 4 4 4 5 5 5 5 5\n    9\n    5 4 3 2 1 2 3 4 5", "output": "YES"}]