#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <stack>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
    int t; cin>>t;
    while(t--){
        ll a[3];
        cin>>a[0]>>a[1]>>a[2];
        int ind[3];
        for(int i=0; i<3; i++) ind[i]=i;
        sort(ind, ind+3, [&](int i, int j){return a[i]<a[j];});
        ll k=(a[ind[2]]-a[ind[1]])/a[ind[0]]+1;
        a[ind[0]]*=k;
        cout<<a[0]<<" "<<a[1]<<" "<<a[2]<<endl;
        
    }
    return 0;
}