## GUPTA MECHANICAL

IN THIS WEBSITE I CAN TELL ALL ABOUT TECH. TIPS AND TRICKS APP REVIEWS AND UNBOXINGS ALSO TECH. NEWS .............

## [Solution] Z mod X = C Codeforces Solution | Codeforces Problem Solution 2022

B. Z mod X = C
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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

$xmody=a,$
$ymodz=b,$
$zmodx=c.$

Here $pmodq$ denotes the remainder from dividing $p$ by $q$. It is possible to show that for such

Input

The input consists of multiple test cases. The first line contains a single integer $t$ ($1\le t\le 10\phantom{\rule{thinmathspace}{0ex}}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\le a).

Output

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

You can output any correct answer.