#include <bits/stdc++.h>

using namespace std;
using ll = long long;

ll gcd (ll a , ll b) {
    if (a < b) swap(a , b);
    if (a % b == 0) return a;
    else return gcd (b , a % b);
}

void solve () {
    vector<ll> v(3);
    for (int i = 0; i < 3; i++) {
        cin >> v[i];
    }
    sort(v.begin() , v.end());
    ll x = v[2] , y = v[1] , z = v[0];
    for (ll i = 1; i * x <= (ll)1e18; i++) {
        for (ll j = 1; j * y <= (ll)1e18; j++) {
            for (ll k = 1; k * z <= (ll)1e18; k++) {
                if (i * x < j * y + k * z && j * y < i * x + k * z && k * z < i * x + j * y) {
                    cout << i * x << " " << j * y << " " << k * z << endl;
                    return;
                }
            }
        }
    }
    return;
}

int main() {
    int t;
    cin >> t;
    while (t--) solve();
	return 0;
}