Rangel's Challenge

Rangel is a computer engineer who, in his spare time, loves to create fun games to entertain his friends.

One day, a teacher asked him to create a game that involved data structures so that the freshmen of his university would lose the fear of AEDs (Algorithms and Data Structures).

Due to the great difficulty of students with AEDs, Rangel created a game based on the indices of a array and gave the name "Rangel’s Challenge" (a very interesting game that can be played on any platform).

The Rangel’s Challenge game works as follows:

• A array V with n elements is generated;
• For every a_i  V of the array you need to find an element a_j  V that is larger than a_i and should appear then a_i, that is a_j > a_i and j > i, and it must be as close as possible to a_i. It is possible that there is no a_j that satisfy the condition, so the answer is “*”;
• The player must enter a array M such that | M | = | V | and the game says whether he hit or not.

For example the array V = [1, 4, 7, 5], for a₁ = 1 the answer will be 4 which is in position a₂, since a₂ > a₁ and the index 2 > 1 and a₂ is closest to a₁, a₂ = 4 the answer will be 7 which is in the position a₃, since a₃ > a₂ and the index 3 > 2, already for a₃ = 7 the answer will be “*” since there is no a_j (j > 3 and j ≤ | V | which satisfies the conditions of the game, the same happens for a₄ = 5. Thus the response to be typed in the console is the array M = [4, 7, *, *].

Rangel has no time to feed the database with the correct answers as he is preparing for a competition and asks you to create the answers for him, because the semester is almost starting and the teacher is waiting for the game.

Given array V, you must create an algorithm that generates the sequence M following the rules of the game.