B. Z mod X = C

You are given three positive integers aa, bb, cc (a<b<ca<b<c). You have to find three positive integers xx, yy, zz such that:

xmody=a,xmody=a,

ymodz=b,ymodz=b,

zmodx=c.zmodx=c.

Here pmodqpmodq denotes the remainder from dividing pp by qq. It is possible to show that for such constraints the answer always exists.

Input

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

Each test case contains a single line with three integers aa, bb, cc (1≤a<b<c≤1081≤a<b<c≤108).

Output

For each test case output three positive integers xx, yy, zz (1≤x,y,z≤10181≤x,y,z≤1018) such that xmody=axmody=a, ymodz=bymodz=b, zmodx=czmodx=c.

You can output any correct answer.

Example

input

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

output

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

Note

In the first test case:

xmody=12mod11=1;xmody=12mod11=1;

ymodz=11mod4=3;ymodz=11mod4=3;

zmodx=4mod12=4.

题目大意：

给你3个数字a,b,c(a<b<c)，找出3个数字x,y,z使得x%y==a,y%z==b,z%x==c;

分析：

因为 a < a + b + c a<a+b+ca<a+b+c，所以 a   m o d   a + b + c = a a\ mod\ a+b+c=aa mod a+b+c=a，a + b + c   m o d   a + c = b a+b+c\ mod\ a+c=ba+b+c mod a+c=b，a + c   m o d   a = c a+c\ mod\ a=ca+c mod a=c。
答案：

#include<bits/stdc++.h>
using namespace std;
int main(){
	int a,b,c,n;
	cin>>n;
	while(n){
		cin>>a>>b>>c;
		cout<<a+b+c<<" "<<b+c<<" "<<c<<endl;
		n--;
	}
}