iCow

Weary from the endless toil of farming, Farmer John has decided to try the MP3 player market with his new iCow. The iCow stores $N$ songs ($1 \le N \le 1000$), numbered $1$ through $N$, and plays them in a "shuffled" order determined by Farmer John's own algorithm:

• Each song $i$ has an initial rating $R_i$ ($1 \le R_i \le 10000$).
• The next song to be played is always the one with the highest rating. If two or more songs are tied, the one with the smallest index is chosen.
• Once a song is played, its rating is set to $0$, and the points it held are distributed evenly among the other $N-1$ songs.
• If the points cannot be distributed evenly (that is, they are not divisible by $N-1$), the leftover points are handed out one at a time to the lowest-numbered songs first ($R_1$, $R_2$, and so on, but never the song that was just played) until no leftover points remain.
• After the next song is played, this process repeats with the updated ratings.

Determine the first $T$ songs ($1 \le T \le 1000$) that the iCow plays.

• Line 1: Two space-separated integers, $N$ and $T$.
• Lines 2 to $N+1$: Line $i+1$ contains a single integer $R_i$.

• Lines 1 to $T$: Line $i$ contains the index of the $i$-th song that the iCow plays.