import sys

# sys.setrecursionlimit(1000005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

# 16s2/t=(t-2a)(t-2b)(t-2c)
# 16s2/t=xyz
# a+(t-y)/2+(t-z)/2=t
# 2a+t-y+t-z=2t
# 2a+t-y+t-z=2t
# y+z=2a
# y2-2ay+v=0
# y=a-sqrt(a2-v)

from math import isqrt

def solve():
    s, t = LI()
    s = s*s*16
    if s%t:
        print(0)
        return
    s //= t
    ans = []
    for x in range(2-(t & 1), t-1, 2):
        if x**3 > s: break
        if s%x: continue
        a = (t-x)//2
        v = s//x
        if a*a-v < 0: continue
        r = isqrt(a*a-v)
        if r*r != a*a-v: continue
        y = a-r
        if y < x: break
        z = a+r
        b, c = (t-y)//2, (t-z)//2
        if a < b+c: ans.append((c, b, a))
    print(len(ans))
    for a, b, c in ans: print(a, b, c)

for _ in range(II()): solve()