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: import sys
  from functools import lru_cache, cmp_to_key
  from heapq import merge, heapify, heappop, heappush
  from math import *
  from collections import defaultdict as dd, deque, Counter as C
  from itertools import combinations as comb, permutations as perm
  from bisect import bisect_left as bl, bisect_right as br, bisect
  from time import perf_counter
  from fractions import Fraction
  
  # sys.setrecursionlimit(int(pow(10, 2)))
  # sys.stdin = open("input.txt", "r")
  # sys.stdout = open("output.txt", "w")
  mod = int(pow(10, 9) + 7)
  mod2 = 998244353
  
  
  def data():
      return sys.stdin.readline().strip()
  
  
  def out(*var, end="\n"):
      sys.stdout.write(" ".join(map(str, var)) + end)
  
  
  def l():
      return list(sp())
  
  
  def sl():
      return list(ssp())
  
  
  def sp():
      return map(int, data().split())
  
  
  def ssp():
      return map(str, data().split())
  
  
  def l1d(n, val=0):
      return [val for i in range(n)]
  
  
  def l2d(n, m, val=0):
      return [l1d(n, val) for j in range(m)]
  
  
  # @lru_cache(None)
  
  N = l()[0]
  D = l()
  M = l()[0]
  T = l()
  d = {}
  t = {}
  for i in range(N):
      if D[i] not in d:
          d[D[i]] = 0
      d[D[i]] += 1
  
  for i in range(M):
      if T[i] not in t:
          t[T[i]] = 0
      t[T[i]] += 1
  ans = "YES"
  for ks in t:
      if ks not in d or d[ks] < t[ks]:
          ans = "NO"
          break
  print(ans)
  
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"}]