In the coding championship, We got N top coders around the world.

This was a single participant coding competition and contained a lot of rounds depending on the number of coders participated.

As there were N coders, each coder had some distinct coding skills. The coding skills of ith coder will be represented by i.

This competition was a bit different from other coding contests. Here In each round, two coders submitted their solution on one question. The coder which had more coding skills took less time to submit that and got ACCEPTED.

Now, In one round, 1st and 2nd coder submitted their solutions on one problem and this is considered to be one match. 3rd and 4th coder submitted their solutions on another problem and so on. This is how matches happened between coders and each match had a different problem. If there was an odd number of coders then the last one got qualified for the next round directly without even a match.

You are given Q queries where each query contains number i, and you have to find the number of matches that ith coder took part in.

INPUT

• The first line of the input contains two integers N(Number of coders) and Q(Number of queries).

• The second line contains N space separated integers(Coding skills of coders)  i₁, i₂, i₃, i₄, . . . . , i_N

OUTPUT

For each query print a single line containing a number of matches played by the ith coder.

CONSTRAINTS

1<=N<=10⁵

1<=Q<=10⁶

1<=i<=N

1<=Coding skills of coders<=10⁹