#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int T;
	cin >> T;
	while (T--) {
		int x[3];
		REP(i, 3) scanf("%d", x + i);
		int ord[3];
		iota(ALL(ord), 0);
		sort(ALL(ord), [&](int i, int j) { return x[i] < x[j]; });
		x[ord[0]] = x[ord[2]] / x[ord[0]] * x[ord[0]];
		x[ord[1]] = x[ord[2]] / x[ord[1]] * x[ord[1]];
		printf("%d %d %d\n", x[0], x[1], x[2]);
	}
}