#D1683. A Barricade
A Barricade
A Barricade
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.
Constraints
- 1 \leq N \leq 1000
- 1 \leq A < B \leq 10^9
- 1 \leq t_i \leq 10^9
- All t_i values are distinct.
Input
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
Output
Print the number of classes you can attend.
Examples
Input
5 5 9 4 3 6 9 1
Output
4
Input
5 4 9 5 6 7 8 9
Output
1
Input
4 3 6 9 6 8 1
Output
4
Input
2 1 2 1 2
Output
1
inputFormat
Input
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
outputFormat
Output
Print the number of classes you can attend.
Examples
Input
5 5 9 4 3 6 9 1
Output
4
Input
5 4 9 5 6 7 8 9
Output
1
Input
4 3 6 9 6 8 1
Output
4
Input
2 1 2 1 2
Output
1
样例
4 3 6
9
6
8
1
4