#include <bits/stdc++.h> #include <atcoder/all> #include <boost/algorithm/string.hpp> using namespace std; using namespace atcoder; typedef long long ll; #define REP(i, n) for(ll i = 0; i < n; i++) #define REPR(i, n) for(ll i = n; i >= 0; i--) #define FOR(i, m, n) for(ll i = m; i < n; i++) #define INF 2e9 #define ALL(v) v.begin(), v.end() #define _GLIBCXX_DEBUG template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; } int main(){ int t; cin>>t; REP(i,t){ vector<pair<ll,char>> abc; map<char,ll> ans; REP(j,3){ ll tmp; cin>>tmp; abc.push_back(make_pair(tmp,'x'+j)); } sort(ALL(abc)); ans[abc[2].second]=abc[2].first; ans[abc[1].second]=abc[1].first; ans[abc[0].second]=((ans[abc[2].second]-ans[abc[1].second]+abc[0].first)/abc[0].first)*abc[0].first; cout<<ans['x']<<" "<<ans['y']<<" "<<ans['z']<<endl; } }