Z mod X = C solution codeforces

You are given three positive integers $a$ , $b$ , $c$ ( $a < b < c$ ). You have to find three positive integers $x$ , $y$ , $z$ such that:

x mod y = a,

y mod z = b,

z mod x = c .

Here $p mod q$ denotes the remainder from dividing $p$ by $q$ . It is possible to show that for such constraints the answer always exists.

Input

Z mod X = C solution codeforces

The input consists of multiple test cases. The first line contains a single integer $t$ ( $1 \leq t \leq 10 000$ ) — the number of test cases. Description of the test cases follows.

Each test case contains a single line with three integers $a$ , $b$ , $c$ ( $1 \leq a < b < c \leq 10^{8}$ ).

Output

For each test case output three positive integers $x$ , $y$ , $z$ ( $1 \leq x, y, z \leq 10^{18}$ ) such that $x mod y = a$ , $y mod z = b$ , $z mod x = c$ .

You can output any correct answer.

Example

input

Z mod X = C solution codeforces

Copy

4
1 3 4
127 234 421
2 7 8
59 94 388

output

Copy

12 11 4
1063 234 1484
25 23 8
2221 94 2609

Note

In the first test case:

x mod y = 12 mod 11 = 1;

y mod z = 11 mod 4 = 3;

z mod x = 4 mod 11 = 4.

Z mod X = C solution codeforces

Z mod X = C solution codeforces

Z mod X = C solution codeforces

Z mod X = C solution codeforces

SOLUTION

“Click here“

Leave a Comment Cancel Reply