#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
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(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int t;
ll S,T;


void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>t;
	while(t--) {
		cin>>S>>T;
		__int128 SS=(__int128)16*S*S;
		
		__int128 tt=T;
		__int128 t2=tt-tt/3+1;
		
		if(SS%tt) {
			cout<<0<<endl;
			continue;
		}
		SS/=tt;
		if(SS>t2*t2*t2) {
			cout<<0<<endl;
			continue;
		}
		
		ll S3=SS;
		ll a,b,c;
		vector<vector<ll>> ret;
		for(c=1;c*c*c<=S3;c++) if(S3%c==0 && (T-c)%2==0) {
			ll C=(T-c)/2;
			ll S2=S3/c;
			ll b=c;
			if((T-b)%2) b++;
			for(;b*b<=S2;b+=2) {
				if(S2%b) continue;
				if((T-S2/b)%2) continue;
				ll A=(T-S2/b)/2;
				ll B=(T-b)/2;
				if(A>0 && A+B+C==T) ret.push_back({A,B,C});
			}
		}
		
		cout<<ret.size()<<endl;
		FORR(a,ret) cout<<a[0]<<" "<<a[1]<<" "<<a[2]<<endl;
		
		
		
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}