output_description: Print the number of classes you can attend.
  
  * * *
input_description: N, A and B are given on the first line and t_i is given on the (i+1)-th line.
  
      
      
      N A B
      t1
      :
      tN
attempt: n, a, b, *s = map(int, open(0).read().split())
  print(sum(t < a or b <= t for t in s))
  
problem_description: Statement
  
  Summer vacation ended at last and the second semester has begun. You, a Kyoto
  University student, came to university and heard a rumor that somebody will
  barricade the entrance of your classroom. The barricade will be built just
  before the start of the A-th class and removed by Kyoto University students
  just before the start of the B-th class. All the classes conducted when the
  barricade is blocking the entrance will be cancelled and you will not be able
  to attend them. Today you take N classes and class i is conducted in the t_i-
  th period. You take at most one class in each period. Find the number of
  classes you can attend.
samples: [{"input": "5 5 9\n    4\n    3\n    6\n    9\n    1", "output": "4\n    \n\nYou can not only attend the third class."}, {"input": "5 4 9\n    5\n    6\n    7\n    8\n    9", "output": "1\n    \n\nYou can only attend the fifth class."}, {"input": "4 3 6\n    9\n    6\n    8\n    1", "output": "4\n    \n\nYou can attend all the classes."}, {"input": "2 1 2\n    1\n    2", "output": "1\n    \n\nYou can not attend the first class, but can attend the second."}]