Migrated from Lutece 100 Fly Through

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

The home of flower fairies is being devastated by a monster called Littlefatcat. They have to leave the place where their generations lived with no other choices. CC, the greatest investigator of flower fairies, found a paradise in the west and will lead all the flower fairies there. This paradise is full of flowers and safe from attack of Littlefatcat. However, there are lots of huge rocks on the way to the paradise.

Flower fairies are of different levels which are determined by their power. Fairies of higher level will fly higher. A fairy will persist in flying at the height corresponding to his or her level for honor and self-respect. Also, rocks on the way have specific height. When the route of a fairy hit a rock, the fairy will have to use magic to fly through the rock. Being aware of the height of all rocks and the specific height each fairy can fly at, CC want to know how many rocks each fairy will fly through.

Input

The first line will be N M, representing for the numbers of rocks and fairies.

The following line will give $N$ numbers, giving the height of the rocks from the east to west.

Then $M$ lines followed. On the $i_{th}$ line, a number representing the specific height of fairy numbered $i$ can fly at will be given.

All numbers are positive and not bigger than $100000$.

Output

Please output the number of rocks each fairy has to fly through in order to get to the paradise in a single line.

Samples

5 3
1 2 3 4 5
2
4
6

4
2
0

Resources

The 8th UESTC Programming Contest Preliminary