A. First Year, Second Year
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Battle of Brains (BoB) is the yearly programming contest among students of the University of Dhaka. Only first and second year students of DU (any department or institute) can take part in the contest. The sole purpose of this contest is to spark an interest in the realm of problem solving in the mind of the freshers and sophomores.

In CSEDU lab, there are two computers on each table. Two contestants may communicate if they are classmates and sit at the same table. But communication is not allowed between contestants since this is an individual contest. So the organizers planned not to seat two classmates at the same table. After all the contestants arrive, the volunteers are going to seat two contestants from two different years at each table. An interesting fact is that every year the number of first-year contestants is larger than the number of second-year contestants. So after a while, some contestants are still standing there and all are first-year students.

The volunteers count the total number of contestants and the number of first-year students who are still standing there.

Now you will be given the total number of contestants and the number of first-year contestants who are still standing there. Your task is to find the number of contestants from first-year and the number of contestants from second-year.

It is guaranteed that the given data is valid according to the aforementioned scenario.

Input

The first line contains a single integer $$$ t \space ( 1 \le t \le 100 ) $$$ denoting the number of test cases.

The only line of each test case contains two integers $$$ a $$$ and $$$ b $$$ $$$ ( 1 \le b < a < 10^9) $$$ describing the total number of contestants and the number of first-year students who are still standing there.

Output

For each test case print a single line containing two integers separated by a space describing the number of first-year contestants and the number of second-year contestants.

Example
Input
2
12 2
15 3
Output
7 5
9 6
Note

In the first sample, there are $$$7$$$ first year students and $$$5$$$ second year students. One can see that this is correct because the total number of students is $$$12$$$ and there will be exactly $$$2$$$ first year students still standing because $$$5$$$ of them will be paired with $$$5$$$ second year students.