Given a number n, find the maximum possible number you can make by deleting exactly k digits.

T : number of test cases ≤ 10³.

1 ≤ number of digits in n ≤ 10⁵. (n might contain leading zeros.)

0 ≤ k ≤ n

if value of n is equal to k. then just print a new line.

Input

T: number of test cases.

T lines follow each with n and k.

Output

The maximum possible number.

Example

Input:
2
1223 2
8756 2
Output:
23
87

Explanation

Note that left to right order should be maintained. As in the example given answer is 23 not 32.