#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;

void solve(long long A, long long B, long long C) {
	while (true) {
		long long t[3] = { A, B, C };
		sort(t, t + 3);
		if (t[0] + t[1] > t[2]) break;
		if (A <= B && A <= C) { A = (B / A + 1LL) * A; }
		else if (B <= A && B <= C) { B = (C / B + 1LL) * B; }
		else if (C <= A && C <= B) { C = (A / C + 1LL) * A; }
	}
	cout << A << " " << B << " " << C << endl;
}

int main() {
	long long T, A, B, C;
	cin >> T;
	for (int i = 1; i <= T; i++) {
		cin >> A >> B >> C;
		solve(A, B, C);
	}
	return 0;
}