#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

void solve() {
  ll s, t; cin >> s >> t;
  s = s * s * 16;
  if (s % t > 0) {
    cout << 0 << '\n';
    return;
  }
  s /= t;
  set<vector<ll>> ans;
  for (ll x = 1; x * x * x <= s && x + x + x <= t; ++x) {
    if (s % x == 0) {
      ll r = s / x;
      for (ll y = x; x * y * y <= s && x + y + y <= t; y += 2) {
        if (r % y == 0) {
          ll z = r / y;
          if (x + y + z == t && (y & 1) == (z & 1)) {
            vector<ll> abc{(y + z) / 2, (z + x) / 2, (x + y) / 2};
            sort(ALL(abc));
            ans.emplace(abc);
          }
        }
      }
    }
  }
  cout << ans.size() << '\n';
  for (const vector<ll> &abc : ans) {
    cout << abc[0] << ' ' << abc[1] << ' ' << abc[2] << '\n';
  }
}

int main() {
  int t; cin >> t;
  while (t--) solve();
  return 0;
}