output_description: If it is possible that there are exactly X cats, print `YES`; if it is
  impossible, print `NO`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      A B X
attempt: import math
  
  
  def comb(a, b):
      return int(math.factorial(a) / math.factorial(b) / math.factorial(a - b))
  
  
  if __name__ == "__main__":
      n = int(input())
      a = [int(x) for x in input().split(" ")]
  
      sa = sorted(a)
  
      oldcmb = -float("inf")
      oldi, oldj = (-1, -1)
      i, j = (-1, -1)
      for i in range(n):
          for j in range(n):
              if i == j or i < j:
                  break
              cmb = comb(sa[i], sa[j])
              # print('old:{} new:{}[{}][{}]'.format(oldcmb, cmb, i, j))
              if cmb > oldcmb:
                  oldcmb = cmb
                  oldi, oldj = (i, j)
          if j == n - 1:
              break
  
      print("{} {}".format(sa[oldi], sa[oldj]))
      # print('{}:{} {}:{}'.format(oldi, sa[oldi], oldj, sa[oldj]))
  
problem_description: Statement
  
  There are a total of A + B cats and dogs. Among them, A are known to be cats,
  but the remaining B are not known to be either cats or dogs.
  
  Determine if it is possible that there are exactly X cats among these A + B
  animals.
samples: [{"input": "3 5 4", "output": "YES\n    \n\nIf there are one cat and four dogs among the B = 5 animals, there are X = 4\ncats in total.\n\n* * *"}, {"input": "2 2 6", "output": "NO\n    \n\nEven if all of the B = 2 animals are cats, there are less than X = 6 cats in\ntotal.\n\n* * *"}, {"input": "5 3 2", "output": "NO\n    \n\nEven if all of the B = 3 animals are dogs, there are more than X = 2 cats in\ntotal."}]