You are given a positive integer \(x\).
You can apply the following operation to the number: remove one occurrence of any digit in such a way that the resulting number does not contain any leading zeroes and is still a positive integer. For example, \(10142\) can be converted to \(1142\), \(1042\), \(1012\) or \(1014\) (note that \(0142\) is not a valid outcome); \(10\) can be converted to \(1\) (but not to \(0\) since it is not positive).
Your task is to find the minimum positive integer that you can obtain from \(x\) if you can apply the aforementioned operation exactly \(k\) times.
Output
For each test case, print one integer — the minimum positive number that you can obtain from \(x\) if you can apply the operation exactly \(k\) times.
Примеры
| № | Входные данные | Выходные данные |
|
1
|
5
10000
4
1337
0
987654321
6
66837494128
5
7808652
3
|
1
1337
321
344128
7052
|