Learning about all the sinusoidal functions of trigonometry, Rahul has grown fond of numbers, whose digits increase and decrease alternatively.

Let's call d[i] is the i^th digit of a number d. Formally, a wavy number is defined as a number d such that either d[0] < d[1] > d[2] ... or d[0] > d[1] < d[2] ...

Given a number N, can you find the integers L and R such that the range [L, N] and [N, R] each contain exactly K wavy numbers. Also, these ranges should be as large as possible.

Note that if no L >= 1 is found or the required value of R exceeds 10¹⁸, you should output -1.

Input:

The first line of input file contains T, the number of test cases to follow.
Each of the following T lines contain two space-separated integers N and K.

Output:

Output exactly T lines, each containing two integers L and R sepated by a single space.

Constraints:

1 <= T <= 625
1 <= K, N <= 10¹⁸