#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;

ll ceil(ll a, ll b) {  // a÷b以上の最小の整数
    if(b == 0) {
        return 0;
    }
    return (a+b-1)/b;
}

int main() {
    ll t;
    cin >> t;

    rep(loop, t) {
        ll a, b, c;
        cin >> a >> b >> c;
        ll x = -1, y = -1, z = -1;
        if(max({a, b, c}) == a) {
            x = a;
            y = ceil(a, b) * b;
            z = ceil(a, c) * c;
        }
        else if(max({a, b, c}) == b) {
            x = ceil(b, a) * a;
            y = b;
            z = ceil(b, c) * c;
        }
        else if(max({a, b, c}) == c) {
            x = ceil(c, a) * a;
            y = ceil(c, b) * b;
            z = c;
        }
        cout << x << " " << y << " " << z << "\n";
    }   

    re0;
}