#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = long long;
#define endl "\n"
typedef pair<int, int> Pii;
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define all(s) (s).begin(),(s).end()
//#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
//#define rep(i, n) rep2(i, 0, n)
#define PB push_back 
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
//#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define fi first
#define se second
#define pb push_back
#define P pair<ll,ll>
#define NP next_permutation
//const ll mod = 998244353;
const ll mod = 1000000007;
const ll inf = 4500000000000000000ll;
const ld eps = ld(0.000000001);
static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll a){ll res=0;while(a){res+=a%2;a/=2;}return res;}
template<class T>
struct Sum{
  vector<T> data;
  Sum(const vector<T>& v):data(v.size()+1){
    for(ll i=0;i<v.size();i++) data[i+1]=data[i]+v[i];
  }
  T get(ll l,ll r) const {
    return data[r]-data[l];
  }
};
template<class T>
struct Sum2{
  vector<vector<T>> data;
  Sum2(const vector<vector<T>> &v):data(v.size()+1,vector<T>(v[0].size()+1)){
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]=data[i][j+1]+v[i][j];
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]+=data[i+1][j];
  }
  T get(ll x1,ll y1,ll x2,ll y2) const {
    return data[x2][y2]+data[x1][y1]-data[x1][y2]-data[x2][y1];
  }
};

void cincout(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(20);
}
ll ans=0,s,t,R;
vector<ll> A,B,C;
void dfs(vector<P> x,ll a,ll b){
//  cout<<R<<" "<<t<<" "<<a<<" "<<b<<endl;
  if(a+b>t) return;
  if(x.size()==0){
  // if(a==297||b==297) cout<<a<<" "<<b<<" "<<t/2-a-b<<endl;
    ll c=t/2-a-b;
    if(c<=0){
      return;
    }
  //  cout<<a*b*c<<" "<<s*s/(t/2)<<endl;
    if(a*b%mod*c%mod==s*s%mod*modPow((t/2),mod-2,mod)%mod){
      A.pb(-a+t/2);
      B.pb(-b+t/2);
      C.pb(-c+t/2);
    }
  }
  else{
    auto y=x;
    rever(y);
    y.pop_back();
    rever(y);
    for(int i=0;i<=x[0].se;i++){
      for(int j=0;j+i<=x[0].se;j++){
        dfs(y,a*modPow(x[0].fi,i,inf),b*modPow(x[0].fi,j,inf));
      }
    }
  }
}
void solve(){
  ans=0;
  A={};
  B={};
  C={};
  cin>>s>>t;
  if(t%4){
    cout<<0<<endl;
    return;
  }
  if(s*s%(t/2)){
    cout<<0<<endl;
    return;
  }
  ll z=s*s/(t/2);
  vector<ll> p;
  for(ll i=2;i*i<=z;i++){
    while(z%i==0){
      p.pb(i);
      z/=i;
    }
  }
  if(z!=1){
    p.pb(z);
  }
 // for(auto e:p) cout<<e<<endl;
  map<ll,ll> m;
  for(auto e:p) m[e]++;
  vector<P> u;
  for(auto e:m) u.pb({e.fi,e.se});
  dfs(u,1,1);
  vector<ll> D,E,F;
  map<P,ll> M;
  for(int i=0;i<A.size();i++){
    if(M[{min({A[i],B[i],C[i]}),max({A[i],B[i],C[i]})}]==0&&max({A[i],B[i],C[i]})<=1000000000ll){
      ans++;
      D.pb(A[i]);
      E.pb(B[i]);
      F.pb(C[i]);
      M[{min({A[i],B[i],C[i]}),max({A[i],B[i],C[i]})}]++;
    }
  }
  cout<<ans<<endl;
  for(int i=0;i<D.size();i++){
    cout<<D[i]<<" "<<E[i]<<" "<<F[i]<<endl;
  }
}
int main() {
  cincout();
  ll t;
  cin>>t;
  while(t--){solve();}
}