Dolphin King is a great man. He can make dolphins do every thing in his control.
One day, he has a whole new idea.
We know each dolphin has different height(when they stand).
He wants to let n dolphins stand in a line and the audience will ask a dolphin a simple question:
How many dolphins shorter than you at the left of you?
But the dolphin thinks too slow. So Dolphin King hopes you can help the poor dolphins to answer the questions.
You are a good guy, please help them.
There are many test cases.
The first line contains a number n(1 <= n <= 50000), which indicates there how many dolphins in this case.
The next line gives you n integers which means the height of each dolphin (numbered from 0 to n-1).
The height of each dolphin is unique.(That is, if a dolphin's height is 5, the others heights will not appear 5.)
The third line contains a number Q(1<=Q<=50000), which means how many people ask problems.
Next Q lines is the question of audience.
Each question has a integer xi that the audience ask.
For each case, output a line with the case number.
Next Q lines each line output the answer of the query.
Output a blank line in the end of each case.
Please refer to the sample output.