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 > q:
    print(0)
    exit()

ans = []
for m in range(1, 100000):
    s = q*m
    b = p*m-q
    if m*b > s: break
    if b <= 0: continue
    if s%b: continue
    ans.append((m, s//b))

sz = len(ans)*2
if ans and ans[-1][0] == ans[-1][1]: sz -= 1
print(sz)
for m, n in ans: print(m, n)
for m, n in ans[::-1]:
    if m == n: continue
    print(n, m)