Problem Statement

You are given positive integers $n$, $a$, and $b$ such that $a<b$.

An integer pair $(L,R)$ such that $1\leq L\leq R$ is said to be a good pair when the following condition holds.

• Let $n_a$ and $n_b$ be respectively the number of multiples of $a$ and the number of multiples of $b$ among the integers between $L$ and $R$, inclusive. Then, $n_a - n_b = n$.

It can be proved that a good pair always exists. Report the good pair with the largest value of $R-L$. If multiple such pairs exist, report the one with the smallest $L$ (from $1\leq L$, the sought $(L, R)$ with the smallest $L$ exists and is unique).

You have $T$ test cases to solve.

Constraints

• $1\leq T\leq 2\times 10^5$
• $1\leq n \leq 10^6$
• $1\leq a < b \leq 10^6$

Input

The input is given from Standard Input in the following format:

T
\text{case}_1
\vdots
\text{case}_T

Each test case is given in the following format:

n a b

Output

Print $T$ lines. The $i$-th line should contain the sought pair $(L,R)$ for the $i$-th test case in the following format:

L R