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: #!/usr/bin/env python
  # -*- coding: utf-8 -*-
  N,M,X = map(int,input().split()) #整数の入力
  a = list(map(int,input().split()))
  #検問所の入力
  b=[]
  c=[]
  for i in range(X+1,N): #X+1からNの範囲の整数について 
    if i in a: #ある整数が検問所の整数として存在する
      b.append(1)
  for i in range(1,X): #1からX-1の範囲の整数について
    if i in a: #ある整数が検問所の整数として存在する
      c.append(1)
  print(min(sum(b),sum(c))
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."}]