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

def floor_sqrt(x):
    a = round(x**0.5-0.49)
    while a**2 > x: a -= 1
    return a

def solve2d(b, c):
    d = b**2-4*c
    if d < 0: return inf, inf
    rd = floor_sqrt(d)
    if rd**2 != d: return inf, inf
    s1, s2 = -b-rd, -b+rd
    if s1 < 0 or s1 & 1: return inf, inf
    return s1//2, s2//2

p, q = LI()

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

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

ans = set()
for g in range(1, 100000):
    s = p*g
    t = q
    h = gcd(s, t)
    s //= h
    t //= h
    a, b = solve2d(-s, t)
    if a == inf: continue
    ans.add((g*a, g*b))
    ans.add((g*b, g*a))

ans = sorted(ans)
print(len(ans))
for mn in ans: print(*mn)