Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Pasha Maximizes

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputPasha 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* ≤ 10^{18}; 0 ≤ *k* ≤ 100).

Output

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

Examples

Input

1990 1

Output

9190

Input

300 0

Output

300

Input

1034 2

Output

3104

Input

9090000078001234 6

Output

9907000008001234

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Nov/17/2018 02:25:45 (d1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|