【cf435B】Pasha Maximizes

2014年5月31日1,4600

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.

Input

The single line contains two integers a and k (1 ≤ a ≤ 1018; 0 ≤ k ≤ 100).

Output

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

Sample test(s)
input

output

input

output

input

output

input

output

题解

贪心,从左到右扫描每一位

将从第i个往后k个内最大且最近的交换上来,k-=距离

使得高位尽量大