#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;

#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
namespace mp = boost::multiprecision;
using Bint = mp::cpp_int;
 
#include<bits/stdc++.h>
using namespace std;

vector<Bint> divisor(Bint x){
  set<Bint> s;
  for(Bint i=1;i*i<=x;i++){
    if(x%i==0){
      s.insert(i);
      s.insert(x/i);
    }
  }
  vector<Bint> res;
  for(auto y:s) res.push_back(y);
  return res;
}
 
int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  int t;
  cin>>t;
  while(t--){
    Bint S,T;
    cin>>S>>T;
    
    if(16*S*S%T!=0){
      cout<<0<<endl;
      continue;
    }
    
    Bint U=16*S*S/T;
    vector<Bint> A=divisor(U);
    sort(ALL(A));
    
    int n=A.size();
    set<pair<Bint,pair<Bint,Bint>>> s;
    rep(i,n){
      if((T-A[i])%2==1) continue;
      for(int j=i;j<n;j++){
        if((T-A[j])%2==1) continue;
        for(int k=j;k<n;k++){
          if((T-A[k])%2==1) continue;
          if(A[i]*A[j]*A[k]!=U) continue;
          if(A[i]+A[j]+A[k]!=T) continue;
          if(A[j]+A[k]>=T+A[i]) continue;        
          s.insert({(T-A[i])/2,{(T-A[j])/2,(T-A[k])/2}});
        }
      }
    }
    
    cout<<s.size()<<endl;
    for(auto t:s){
      cout<<t.first<<" "<<t.second.first<<" "<<t.second.second<<endl;
    }
  }

  return 0;
}