codeforces#P1584A. Mathematical Addition
Mathematical Addition
Description
Ivan decided to prepare for the test on solving integer equations. He noticed that all tasks in the test have the following form:
- You are given two positive integers and , find any pair of integers (not necessarily positive) , , such that:
- The solution , is forbidden, so you should find any solution with .
Please help Ivan to solve some equations of this form.
The first line contains a single integer () — the number of test cases. The next lines contain descriptions of test cases.
The only line of each test case contains two integers and () — the parameters of the equation.
For each test case print two integers , — a possible solution to the equation. It should be satisfied that and .
We can show that an answer always exists. If there are multiple possible solutions you can print any.
Input
The first line contains a single integer () — the number of test cases. The next lines contain descriptions of test cases.
The only line of each test case contains two integers and () — the parameters of the equation.
Output
For each test case print two integers , — a possible solution to the equation. It should be satisfied that and .
We can show that an answer always exists. If there are multiple possible solutions you can print any.
Samples
Note
In the first test case: .
In the second test case: .
In the third test case: .
In the fourth test case: .