import sys

# sys.setrecursionlimit(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 << 63)-1
# inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

from math import gcd

p, q = LI()
g = gcd(p, q)
p //= g
q //= g

if p > 2*q:
    print(0)
    exit()

# x2-gpx+gq=0
# g=x2/(px-q)
ans = []
if p == 1: ans.append((q*2, q*2))
if p == 2: ans.append((q, q))

for x in range(q//p+1, q//p+100000):
    if (x**2)%(p*x-q): continue
    g = (x**2)//(p*x-q)
    if g < 1: continue
    y = g*p-x
    if x >= y: break
    ans.append((x, y))
    ans.append((y, x))

ans.sort(key=lambda x: x[0])
print(len(ans))
for x, y in ans: print(x, y)