SOLVE
LATER
Little Shino is interested in the fighting tournaments. Once she went to watch one of the tournaments. There were N fighters and \(i^{th}\) fighter will be represented by i. Each fighter has some distinct strength. Rules of the tournament are:
Input:
First line contains 2 integers, N and Q, number of fighters and number of queries.
Second line contains N space separated integers. \(k^{th}\) integer represents the strength of \(k^{th}\) fighter.
Next Q line contain one integer i each, denoting Q queries.
Output:
For each query, print the number of fights \(i^{th}\) fighter will take part in.
Constraints:
\(1 \le N \le 10^5\)
\(1 \le Q \le 10^6\)
\(1 \le i \le N\)
\(1 \le strength\;of\;fighters \le 10^9\)
The fights in first round will be between (1, 2) and (3, 4).
From fight between (1, 2), 2 will win and from fight between (3, 4), 4 will win.
Second round will have 3 fighters left. {2, 4, 5}.
In second round there will be one fight between (2, 4) and 4 will win the fight.
Third round will have 2 fighters left. {4, 5}
There will one fight in the third round between (4, 5) and 5 will win in the fight.
Number of fight 1 took part in: 1
Number of fight 2 took part in: 2
Number of fight 3 took part in: 1
Number of fight 4 took part in: 3
Number of fight 5 took part in: 1