#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("YES");}else{puts("NO");} #define MAX_N 200005 int main() { int T; cin >> T; rep(_,T){ ll a, b, c; cin >> a >> b >> c; while(true){ ll sum = a + b + c; int ok = 1; if(sum - a <= a) ok = 0; if(sum - b <= b) ok = 0; if(sum - c <= c) ok = 0; if(ok) break; if(min(a,min(b,c)) == a) a *= 2; else if(min(a,min(b,c)) == b) b *= 2; else c *= 2; } cout << a << ' ' << b << ' ' << c << endl; } return 0; }