Sloppy Acorn Classifier

A sloppy classifier is used to sort acorns by size.

The classifier is a tilted board with $N$ holes. The holes are numbered from 1 to $N$, starting from the highest one. The size of hole $i$ is $a_i$.

When an acorn is dropped into the classifier, it rolls past hole 1, then hole 2, and so on up to hole $N$. The surface is rough, so the acorn shrinks by 1 after it passes each hole. For example, if an acorn has size 10 when it passes hole 1, its size is 9 when it passes hole 2. Likewise, an acorn that has passed hole 2 has size 8 when it passes hole 3.

An acorn falls into a hole when that hole's size is greater than or equal to the acorn's current size.

For each of the $Q$ acorns, write a program that finds the number of the hole it falls out of. Under the given constraints, every acorn can fall out of some hole, whatever its size.

The first line contains the number of holes $N$. The second line contains the sizes of the holes $a_1, a_2, \cdots, a_N$, separated by spaces. The third line contains the number of acorns $Q$. The fourth line contains the sizes of the acorns $s_1, s_2, \cdots, s_Q$, separated by spaces.

For each acorn, print the number of the hole it falls out of, in the order the acorns are given. Separate the numbers with spaces.

• $1 \le N \le 10^5$
• $1 \le a_i \le N$
• $1 \le Q \le 10^5$
• $1 \le s_i \le N$