#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <climits>

#define rep(i, n) for(int i = 0; i < n; i++)
#define per(i, n) for(int i = n - 1; i >= 0; i--)
using ll = long long;
#define vi vector<int>
#define vvi vector<vi>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define mod 1000000007
using namespace std;
void solve(){
  ll a,b,c;
  cin >> a >> b >> c;
  ll mx = max({a, b, c});
  ll mn = min({a, b, c});
  if(mx * 2 >= a + b + c){
    ll cnt = 1;
    ll dif = mx*2 -a-b-c + mn;
    while(mn * cnt <= dif) cnt++;
    if(mn == a) cout << mn * cnt << " " << b << " " << c << "\n";
    else if(mn == b) cout << a << " " << mn * cnt << " " << c << "\n";
    else cout << a << " " << b << " " << mn * cnt << "\n";
  }else cout << a << " " << b << " " << c << "\n";
}
int main(){
  int t;
  cin >> t;
  rep(i, t) solve();
}