Pasha Maximizes

有一个长度为$n$的正整数。可以对这个数进行交换相邻两个数位的操作。最多能进行$k$次这样的操作，问能得到的最大的数是多少。

Pasha has a positive integer $ a $ without leading zeroes. Today he decided that the number is too small and he should make it larger. Unfortunately, the only operation Pasha can do is to swap two adjacent decimal digits of the integer. Help Pasha count the maximum number he can get if he has the time to make at most $ k $ swaps.

The single line contains two integers $ a $ and $ k $ $ (1<=a<=10^{18}; 0<=k<=100) $ .

Print the maximum number that Pasha can get if he makes at most $ k $ swaps.

1990 1

9190

300 0

300

1034 2

3104

9090000078001234 6

9907000008001234