#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
long long cheker(long long n) {
	if (n < 0)return -1;
	for (long long i = sqrt(n) - 10; i <= sqrt(n) + 10; ++i) {
		if (i * i == n)return i;
	}
	return -1;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int q; cin >> q;
	while (q--) {
		long long s, t; cin >> s >> t;
		long long r = s * s * 16;
		if (0 != r % t) {
			cout << 0 << endl;
			continue;
		}
		r /= t;
		vector<long long>vx;
		for (long long i = 1; i*i <= r; ++i) {
			if (0 != r % i)continue;
			vx.push_back(i);
			if (r != i * i)vx.push_back(r / i);
		}
		sort(all(vx));
		//r = x*y*(t-x-y)
		set<pair<long long, pair<long long, long long>>>ans;
		rep(i, vx.size()) {
			long long x = vx[i];
			long long rx = r / x;
			//rx = y(t-x-y)
			//y=((t-x)±sqrt((x-t)^2-4*rx))/2
			long long sq = cheker((x - t) *(x - t) - 4 * rx);
			if (-1 == sq)continue;
			if (0 != abs(t - x - sq) % 2)continue;
			rep(j, 2) {
				long long y = (t - x - sq) / 2;
				if (1 == j) (t - x + sq) / 2;
				if (y > 0) {
					long long z = t - x - y;
					if (z > 0) {
						if ((0 == (abs(x - y) % 2)) && (0 == (abs(x - z) % 2))) {
							vector<int>abc(3);
							abc[0] = (x + y) / 2;
							abc[1] = (x + z) / 2;
							abc[2] = (y + z) / 2;
							sort(all(abc));
							ans.insert({ abc[0],{abc[1],abc[2]} });
						}
					}
				}
			}
		}
		cout << ans.size() << endl;
		for (auto abc : ans) {
			cout << abc.first << " " << abc.second.first << " " << abc.second.second << endl;
		}
	}
	return 0;
}