B. Pasha Maximizestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard 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.InputThe single line contains two integers a and k (1 ≤ a ≤ 1018; 0 ≤ k ≤ 100).OutputPrint the maximum number that Pasha can get if he makes at most k swaps.ExamplesInput1990 1Output9190Input300 0Output300Input1034 2Output3104Input9090000078001234 6Output9907000008001234
Input1990 1
Output9190
['greedy', '*1400']