#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (ll i=(ll)N-1; i>=0; i--)
#define popcount __builtin_popcount

const ll LLINF = pow(2,61)-1;
const ll INF = pow(2,30)-1;

ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

vector<ll> rho_algorithm(ll N, bool st=true) {
  if (N==1) return {};
  repr(i,2,min(N,10ll)) {
    ll x = i, y = i, d = 1;
    if (N%x==0) d = x;
    else {
      bool ok = true;
      while (gcd(d,N)==1) {
        x = (x*x+1) % N;
        rep(i,2) y = (y*y+1) % N;
        d = gcd(abs(x-y),N);
        if (d==N) ok = false;
      }
      if (!ok) continue;
    }
    vector<ll> result = rho_algorithm(N/d,false);
    vector<ll> r2 =  rho_algorithm(d,false);
    for (auto x: r2) result.push_back(x);
    if (st) sort(all(result));
    return result;
  }
  return {N};
}

int main() {
  ll t; cin >> t;
  rep(_,t) {
    ll S, T; cin >> S >> T;
    if ((16ll*S*S)%T) { cout << 0 << endl; continue; }
    ll R = 16ll*S*S/T;
    // cout << R << endl;
    vector<ll> soin = rho_algorithm(R);
    map<ll, ll> ms; for (auto x: soin) ms[x]++;
    vector<ll> divisors = {1};
    for (auto x: ms) {
      vector<ll> tdiv = divisors;
      for (auto y: divisors) {
        ll ny = y;
        rep(i,x.second) {
          ny *= x.first;
          tdiv.push_back(ny);
        }
      }
      divisors = tdiv;
    }
    sort(all(divisors));
    // debug(all(divisors));
    set<vector<ll>> result;
    for (auto x: divisors) {
      if ((T-x)%2||T<=x) continue;
      ll b2mac = ((T-x)/2)*((T-x)/2) - R/x;
      if (pow((ll)sqrt(b2mac),2)!=b2mac) continue;
      ll y = (T-x)/2 + sqrt(b2mac), z = (T-x)/2 - sqrt(b2mac);
      if ((T-y)%2) continue;
      vector<ll> r = {(T-x)/2, (T-y)/2, (T-z)/2}; sort(all(r));
      result.insert(r);
    }
    cout << result.size() << endl;
    for (auto x: result) debug(all(x));
  }
  return 0;
}