Smallest Number

You are given a number $n$ and your task is to find the minimum number you can form from it by swapping any two digit for $k$ times. ### Input - First line contains single integer $T$ denoting number of testcases. - Each test case contains two space separated integer denoting the number you have to reduce and the max number of swap that you can perform ### Output Single integer denoting the smal