Harry Potter and the Battle for Hogwarts

The decisive battle for Hogwarts is coming. All $n$ of its inhabitants have gathered in the hall to repel the enemy's attack. Each defender of Hogwarts has a magic power, which is a natural number from $1$ to $n$. All defenders have different magic powers.

Harry decided that the line of defenders would best repel the attack if the magic power increases from left to right. However, the defenders are already standing in a line that may not satisfy this condition.

To repel the attack, Harry wants to rearrange the defenders in increasing order of magic power. He uses the following algorithm. He walks from left to right and looks at each pair of neighboring defenders. If the left defender is stronger than the right one, he swaps them.

From the course "Fundamentals of Muggle Informatics", Harry knows that after $n-1$ such passes, all defenders will be in increasing order of magic power. However, time is short, so Harry can only make $k$ passes.

Help Harry find the order in which the defenders will meet the enemy army.

The first line contains an integer $n$ ($1 \le n \le 200000$), the number of defenders, and an integer $k$ ($0 \le k \le n-1$), the number of passes Harry can make. The second line contains $n$ integers $a_i$ ($1 \le a_i \le n$), the magic powers of the defenders in the original line from left to right.

Print $n$ integers $b_i$ on a single line, the magic powers of the defenders from left to right after Harry makes $k$ passes.