#include<bits/stdc++.h>
using namespace std;

void solve(){
  using ll=long long;
  ll l;
  cin>>l;
  ll x=l;
  while (x%2==0) x/=2;
  if (x==1){
    ll k=l/4;
    cout<<3*k<<" "<<4*k<<" "<<5*k<<endl;
    return;
  }
  ll m=x/2+1,n=x/2;
  ll a=m*m-n*n,b=2*m*n,c=m*m+n*n;
  __int128_t k=l/a;
  __int128_t A=a*k,B=b*k,C=c*k;
  auto f=[&](__int128_t x){
    vector<int> vec;
    while (x){
      vec.push_back(x%10);
      x/=10;
    }
    reverse(vec.begin(),vec.end());
    for (int a:vec) cout<<a;
    return "";
  };
  cout<<f(A)<<" "<<f(B)<<" "<<f(C)<<endl;
}

int main(){
  int t;
  cin>>t;
  while (t--) solve();
}