410203: GYM103973 M Walk Alone's Conjecture

Walk Alone has a conjecture which says

• Any positive integer can be expressed as the difference between two positive integers with the same number of prime factors.

He fails to prove it, so he wants you to prove it in a small range. Your work is to construct two integers $$$x$$$ and $$$y$$$ such that

• $$$y-x=n$$$.
• $$$x$$$ and $$$y$$$ has the same number of prime factors.

The first line contains one integer $$$T\ (1 \leq T \leq 10^5)$$$, the number of test cases.

Each test case consists of only one line with an integer $$$n\ (1 \leq n \leq 10^8)$$$, denoting the number Walk Alone wants you to prove.

For each test case, print two integers $$$x$$$ and $$$y\ (1 \leq x < y \leq 10^{10})$$$ in one line satisfying the constraints above.

3
1
2
3

2 3
2 4
12 15