CF706B Interesting drink

Vasiliy likes to rest after a hard work, so you may often meet him in some bar nearby. As all programmers do, he loves the famous drink "Beecola", which can be bought in $ n $ different shops in the city. It's known that the price of one bottle in the shop $ i $ is equal to $ x_{i} $ coins. Vasiliy plans to buy his favorite drink for $ q $ consecutive days. He knows, that on the $ i $ -th day he will be able to spent $ m_{i} $ coins. Now, for each of the days he want to know in how many different shops he can buy a bottle of "Beecola".

The first line of the input contains a single integer $ n $ ( $ 1

Print $ q $ integers. The $ i $ -th of them should be equal to the number of shops where Vasiliy will be able to buy a bottle of the drink on the $ i $ -th day.

On the first day, Vasiliy won't be able to buy a drink in any of the shops. On the second day, Vasiliy can buy a drink in the shops $ 1 $ , $ 2 $ , $ 3 $ and $ 4 $ . On the third day, Vasiliy can buy a drink only in the shop number $ 1 $ . Finally, on the last day Vasiliy can buy a drink in any shop.