After he got tired of rotating tables, the professor gave RK another problem. He wrote two integers, A and B, on the blackboard and asked him to add them.

RK is never wrong with his calculation, but sometimes he doesn’t copy the numbers correctly.

The only mistake he ever makes is copying a ‘5’ as a ‘6’, and vice versa.

Given two numbers, A and B, calculate the minimum and the maximum sum RK could possibly get.

Input

First line of Input contains no. of test cases T (T <= 100). Each test case contains one line having two positive integer A and B (1 <= A, B <= 10^6).

Output

For each test case print two space separated integers, minimum and maximum sum RK could get.

Example

Input:
2
11 25
16796 58786

Output:
36 37
74580 85582