#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll I=1167167167167167167;
ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}

void solve();

//おちこんだりもしたけれど、私はげんきです。
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t;
	cin>>t;
	rep(i,t) solve();
}

void solve(){
	ll S,T;
	cin>>S>>T;
	S*=S;
	S*=16;
	if(S%T!=0){
		cout<<"0\n";
		return ;
	}
	S/=T;
	vector<tuple<ll,ll,ll>> ans;
	for(ll i=1;i<T;i++){
		if(i*i*i>S||3*i>T) break;
		if(S%i!=0) continue;
		ll X=S/i;
		ll Y=T-i;
		if(Y%2!=0) continue;
		ll l=0,r=Y/2;
		while(r-l>1){
			ll D=(l+r)/2;
			if(D*(Y-D)>=X) r=D;
			else l=D;
		}
		if(r*(Y-r)!=X) continue;
		if(r%2!=i%2) continue;
		if(i<=r){
			ans.push_back({i,r,Y-r});
		}
	}
	cout<<ans.size()<<"\n";
	rep(i,ans.size()){
		ll a,b,c;
		tie(a,b,c)=ans[i];
		cout<<(T-a)/2<<" "<<(T-b)/2<<" "<<(T-c)/2<<"\n";
	}
}