405803: GYM102114 B Beautiful Now

Anton has a positive integer n, however, it quite looks like a mess, so he wants to make it beautiful after k swaps of digits.

Let the decimal representation of n as (x_1x2... x_m)₁₀ satisfying that 1 ≤ x₁ ≤ 9, 0 ≤ x_i ≤ 9 (2 ≤ i ≤ m), which means . In each swap, Anton can select two digits x_i and x_j (1 ≤ i ≤ j ≤ m) and then swap them if the integer after this swap has no leading zero.

Could you please tell him the minimum integer and the maximum integer he can obtain after k swaps?

The first line contains one integer T, indicating the number of test cases.

Each of the following T lines describes a test case and contains two space-separated integers n and k.

1 ≤ T ≤ 100, 1 ≤ n, k ≤ 10⁹.

For each test case, print in one line the minimum integer and the maximum integer which are separated by one space.

5
12 1
213 2
998244353 1
998244353 2
998244353 3

12 21
123 321
298944353 998544323
238944359 998544332
233944859 998544332