#include <bits/stdc++.h>
using namespace std;
void dfs(vector<tuple<int, int, int>> &ans, vector<pair<int, int>> &F, long long s, long long x, long long y, long long z, int p){
  int cnt = F.size();
  if (p == cnt){
    if (x + y + z == s && max({x, y, z}) <= 1000000000){
      vector<long long> a = {x, y, z};
      sort(a.begin(), a.end());
      ans.push_back(make_tuple(a[0], a[1], a[2]));
    }
  } else {
    int b = F[p].first;
    int e = F[p].second;
    vector<long long> POW(e + 1);
    POW[0] = 1;
    for (int i = 0; i < e; i++){
      POW[i + 1] = POW[i] * b;
    }
    for (int i = 0; i <= e; i++){
      for (int j = 0; j <= e - i; j++){
        dfs(ans, F, s, x * POW[i], y * POW[j], z * POW[e - i - j], p + 1);
      }
    }
  }
}
int main(){
  int t;
  cin >> t;
  for (int i = 0; i < t; i++){
    long long S, T;
    cin >> S >> T;
    if (T % 2 != 0){
      cout << 0 << endl;
    } else if (S * S * 2 % T != 0){
      cout << 0 << endl;
    } else {
      long long s = T / 2;
      long long p = S * S * 2 / T;
      map<int, int> mp;
      for (long long j = 2; j * j <= S; j++){
        while (S % j == 0){
          mp[j] += 2;
          S /= j;
        }
      }
      if (S > 1){
        mp[S] += 2;
      }
      mp[2]++;
      for (long long j = 2; j * j <= T; j++){
        while (T % j == 0){
          mp[j]--;
          T /= j;
        }
      }
      if (T > 1){
        mp[T]--;
      }
      vector<pair<int, int>> F;
      for (auto P : mp){
        if (P.second != 0){
          F.push_back(P);
        }
      }
      vector<tuple<int, int, int>> ans;
      dfs(ans, F, s, 1, 1, 1, 0);
      sort(ans.begin(), ans.end());
      ans.erase(unique(ans.begin(), ans.end()), ans.end());
      int cnt = ans.size();
      cout << cnt << endl;
      for (int j = 0; j < cnt; j++){
        cout << s - get<0>(ans[j]) << ' ' << s - get<1>(ans[j]) << ' ' << s - get<2>(ans[j]) << endl;
      }
    }
  }
}