#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

void solve(){
    ll A, B, C;
    cin >> A >> B >> C;
    if(max({A, B, C}) == A){
        ll w = (B + C + A - 1) / A + 1;
        cout << A << ' ' << B * w << ' ' << C * w << '\n';
    }
    else if(max({A, B, C}) == B){
        ll w = (C + A + B - 1) / B + 1;
        cout << A * w << ' ' << B << ' ' << C * w << '\n';
    }
    else{
        ll w = (A + B + C - 1) / C + 1;
        cout << A * w << ' ' << B * w << ' ' << C << '\n';
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;
    cin >> T;
    while(T--)  solve();

    return 0;
}