Z mod X = C Codeforces Solution | Codeforces Problem Solution 2022

[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<b<c$). You have to find three positive integers 𝑥$x$, 𝑦$y$, 𝑧$z$ such that:

𝑥mod𝑦=𝑎,$$xmody=a,$$

𝑦mod𝑧=𝑏,$$ymodz=b,$$

𝑧mod𝑥=𝑐.$$zmodx=c.$$

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

Solution Click Below:-  CLICK HERE

constraints the answer always exists.

Input

The input consists of multiple test cases. The first line contains a single integer 𝑡$t$ (1≤𝑡≤10000$1\le t\le 10000$) — the number of test cases. Description of the test cases follows.

Digit Minimization Codeforces Solution

Z mod X = C Codeforces Solution

Column Swapping Codeforces Solution

Traps Codeforces Solution

MEX vs DIFF Codeforces Solution

Diverse Segments Codeforces Solution

Euclid Guess Codeforces Solution

Hard Cut Codeforces Solution

Each test case contains a single line with three integers 𝑎$a$, 𝑏$b$, 𝑐$c$ (1≤𝑎<𝑏<𝑐≤108$1\le a<b<c\le {10}^8$).

Output

For each test case output three positive integers 𝑥$x$, 𝑦$y$, 𝑧$z$ (1≤𝑥,𝑦,𝑧≤1018$1\le x,y,z\le {10}^{18}$) such that 𝑥mod𝑦=𝑎$xmody=a$, 𝑦mod𝑧=𝑏$ymodz=b$, 𝑧mod𝑥=𝑐$zmodx=c$.

You can output any correct answer.