Play with Floor and Ceil
Theorem. For any two integers x and k there exists two more integers p and q such that
It’s a fairly easy task to prove this theorem, so we’d not ask you to do that. We’d ask for something even easier! Given the values of x and k, you’d only need to find integers p and q that satisfies the given equation.
Input
The first line contains the number of test cases t (1 ≤ t ≤ 1000). In each of the following t lines you’d be given two positive integers x and k. You can assume that x and k will always be less than 10^8.
Output
For each test cases print in one line two integers p and q. If there are multiple pairs of p and q that satisfy the equation, any one would do. But to help us keep our task simple, please make sure that the values p * floor(x/k) and q * ceil(x/k) fit in a 64 bit signed integer.