#include <bits/stdc++.h>

using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

class rep {
    struct Iter {
        usize itr;
        constexpr Iter(const usize pos) noexcept : itr(pos) {}
        constexpr void operator++() noexcept { ++itr; }
        constexpr bool operator!=(const Iter& other) const noexcept { return itr != other.itr; }
        constexpr usize operator*() const noexcept { return itr; }
    };
    const Iter first, last;

  public:
    explicit constexpr rep(const usize first, const usize last) noexcept : first(first), last(std::max(first, last)) {}
    constexpr Iter begin() const noexcept { return first; }
    constexpr Iter end() const noexcept { return last; }
};

template <class T> using Vec = std::vector<T>;

void main_() {
    i64 S, T;
    std::cin >> S >> T;
    if (16 * S * S % T != 0) {
        std::cout << 0 << '\n';
        return;
    }
    const auto U = 16 * S * S / T;
    std::set<std::array<i64, 3>> set;
    for (i64 x = 1; x * x * x <= U and 3 * x <= T; ++x) {
        if (U % x == 0 and (T - x) % 2 == 0) {
            const auto sum = T - x;
            const auto prd = U / x;
            // t * t - sum * t  + prd = 0 の 2 解
            const auto D = sum * sum - 4 * prd;
            if (D < 0) {
                continue;
            }
            const i64 sqrt = std::sqrt(D);
            if (sqrt * sqrt != D) {
                continue;
            }
            if (sum % 2 != sqrt % 2) {
                continue;
            }
            const auto y = (sum - sqrt) / 2;
            const auto z = (sum + sqrt) / 2;
            if ((T - y) % 2 != 0 or (T - z) % 2 != 0 or y <= 0 or z <= 0) {
                continue;
            }
            std::array<i64, 3> arr;
            arr[0] = (T - x) / 2;
            arr[1] = (T - y) / 2;
            arr[2] = (T - z) / 2;
            std::sort(arr.begin(), arr.end());
            set.insert(std::move(arr));
        }
    }
    std::cout << set.size() << '\n';
    for (const auto& [a, b, c] : set) {
        std::cout << a << ' ' << b << ' ' << c << '\n';
    }
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    usize cases;
    std::cin >> cases;
    while (cases--) main_();
    return 0;
}