CF1337A.Ichihime and Triangle

Ichihime is the current priestess of the Mahjong Soul Temple. She claims to be human, despite her cat ears.

These days the temple is holding a math contest. Usually, Ichihime lacks interest in these things, but this time the prize for the winner is her favorite — cookies. Ichihime decides to attend the contest. Now she is solving the following problem.

You are given four positive integers $a$, $b$, $c$, $d$, such that $a \leq b \leq c \leq d$.

Your task is to find three integers $x$, $y$, $z$, satisfying the following conditions:

• $a \leq x \leq b$.
• $b \leq y \leq c$.
• $c \leq z \leq d$.
• There exists a triangle with a positive non-zero area and the lengths of its three sides are $x$, $y$, and $z$.

Ichihime desires to get the cookie, but the problem seems too hard for her. Can you help her?

伊希美是麻将之魂神社现任巫女。尽管她长着猫耳，却坚称自己是人类。

近日，神社正在举办一场数学竞赛。通常情况下，伊希美对这类活动毫无兴趣；但这次冠军的奖品却是她最爱的——曲奇饼干！于是伊希美决定参加竞赛。此刻，她正着手解决如下问题：

给定四个正整数 $a$、$b$、$c$、$d$，满足 $a \leq b \leq c \leq d$。

你的任务是找出三个整数 $x$、$y$、$z$，使其满足以下条件：

• $a \leq x \leq b$；
• $b \leq y \leq c$；
• $c \leq z \leq d$；
• 存在以 $x$、$y$、$z$ 为三边长的三角形，且该三角形面积为正（即非退化三角形）。

伊希美渴望得到曲奇饼干，但这个问题对她而言似乎过于困难。你能帮帮她吗？

The first line contains a single integer $t$ ($1 \leq t \leq 1000$) — the number of test cases.

The next $t$ lines describe test cases. Each test case is given as four space-separated integers $a$, $b$, $c$, $d$ ($1 \leq a \leq b \leq c \leq d \leq 10^9$).

第一行包含一个整数 $t$（$1 \leq t \leq 1000$）—— 表示测试用例的数量。

接下来的 $t$ 行描述各个测试用例。每个测试用例由四个以空格分隔的整数 $a$、$b$、$c$、$d$ 给出（$1 \leq a \leq b \leq c \leq d \leq 10^9$）。

For each test case, print three integers $x$, $y$, $z$ — the integers you found satisfying the conditions given in the statement.

It is guaranteed that the answer always exists. If there are multiple answers, print any.

对于每个测试用例，输出三个整数 $x$、$y$、$z$ —— 即你找到的满足题目所述条件的整数。

保证答案一定存在。若存在多个答案，输出任意一个即可。

One of the possible solutions to the first test case:

One of the possible solutions to the second test case:

第一个测试用例的一种可能解法：

第二个测试用例的一种可能解法：