from collections import Counter, deque


def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a


def n_fact(N):
    c = Counter(prime_factorize(N))
    return c


P, Q = map(int, input().split())
if P > 2 * Q:
    print(0)
    exit()

PF = n_fact(Q)
from collections import deque

q = deque([1])
for k, v in PF.items():
    q2 = deque()
    while q:
        x = q.pop()
        for i in range(2 * v + 1):
            q2.append(x * pow(k, i))
    q = q2

ans = set()
for d in q:
    if (d + Q) % P == 0:
        n = (d + Q) // P
        if Q * n % (P * n - Q) == 0:
            m = Q * n // (P * n - Q)
            ans.add((n, m))

ans = list(ans)
ans.sort()
print(len(ans))
for a in ans:
    print(*a)