#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

void solve(){
  ll A,B,C;
  cin>>A>>B>>C;

  vector<ll> ans(3,0);
  ll ma=max(A,max(B,C));

  if(A==ma){
    ans[0]=A;
    ans[1]=B*C*A;
    ans[2]=B*C*A;
  }else if(B==ma){
    ans[0]=A*B*C;
    ans[1]=B;
    ans[2]=A*B*C;
  }else{
    ans[0]=A*B*C;
    ans[1]=A*B*C;
    ans[2]=C;
  }

  cout<<ans[0]<<" "<<ans[1]<<" "<<ans[2]<<"\n";
}

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

  int T;
  cin>>T;
  rep(i,T) solve();

  return 0;
}