#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    int32_t t;
    cin >> t;
    vector<tuple<int32_t, int32_t, int32_t>> xs(t);
    for (auto &&x : xs) {
        cin >> get<0>(x) >> get<1>(x) >> get<2>(x);
    }
    for (auto &&x : xs) {
        vector<int32_t> ys = {get<0>(x), get<1>(x), get<2>(x)};
        sort(ys.begin(), ys.end());
        if (!(ys[0] + ys[1] < ys[2]))
            ys[0] = (ys[2] - ys[1] + 1) / ys[0] * ys[0];
        cout << ys[0] << " " << ys[1] << " " << ys[2] << endl;
    }
    return 0;
}