传送门
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≤b≤c≤d.
Your task is to find three integers x, y, z, satisfying the following conditions:
a≤x≤b.
b≤y≤c.
c≤z≤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?
Input
The first line contains a single integer t (1≤t≤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≤a≤b≤c≤d≤109).
Output
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.
Example
Input
4
1 3 5 7
1 5 5 7
100000 200000 300000 400000
1 1 977539810 977539810
Output
3 4 5
5 5 5
182690 214748 300999
1 977539810 977539810
Note
One of the possible solutions to the first test case:
One of the possible solutions to the second test case:
题意： T组数据，每组给定a, b, c, d，规定三角形的的三边x, y, z的长度范围在a≤x≤b≤y≤c≤z≤d，请输出能构成三角形的三条边长。
题解： 只要输出其中一种情况即可，只要将三边特殊化，让y和z相等，那么x取多少长都可以。所以三边只要选择a,c,c或者b,c,c就行。
#include<iostream>
#include<algorithm>
using namespace std;
int t, a, b, c, d;
int main(){
scanf("%d", &t);
while(t--){
scanf("%d%d%d%d", &a, &b, &c, &d);
printf("%d %d %d\n", b, c, c);
}
return 0;
}