A robber has attempted to rob a bank but failed to complete his task. However, he had managed to open all the safes. Oleg the bank client loves money (who doesn't), and decides to take advantage of this failed robbery and steal some money from the safes. There are many safes arranged in a line, where the i -th safe from the left is called safe i . There are n banknotes left in all the safes in total. The i -th banknote is in safe x i . Oleg is now at safe a . There are two security guards, one of which guards the safe b such that b < a , i.e. the first guard is to the left of Oleg. The other guard guards the safe c so that c > a , i.e. he is to the right of Oleg. The two guards are very lazy, so they do not move. In every second, Oleg can either take all the banknotes from the current safe or move to any of the neighboring safes. However, he cannot visit any safe that is guarded by security guards at any time, becaues he might be charged for stealing. Determine the maximum amount of banknotes Oleg can gather. The first line of input contains three space-separated integers, a , b and c ( 1 ≤ b < a < c ≤ 10 9 ), denoting the positions of Oleg, the first security guard and the second security guard, respectively. The next line of input contains a single integer n ( 1 ≤ n ≤ 10 5 ), denoting the number of banknotes. The next line of input contains n space-separated integers x 1 , x 2 , ..., x n ( 1 ≤ x i ≤ 10 9 ), denoting that the i -th banknote is located in the x i -th safe. Note that x i are not guaranteed to be distinct. Output a single integer: the maximum number of banknotes Oleg can take. In the first example Oleg can take the banknotes in positions 4 , 5 , 6 (note that there are 2 banknotes at position 5 ). Oleg can't take the banknotes in safes 7 and 8 because he can't run into the second security guard. Similarly, Oleg cannot take the banknotes at positions 3 and 2 because he can't run into the first security guard. Thus, he can take a maximum of 4 b