def makediv(n):
	lower_divisors , upper_divisors = [], []
	i = 1
	while i*i <= n:
		if n % i == 0:
			lower_divisors.append(i)
			if i != n // i:
				upper_divisors.append(n//i)
		i += 1
	return lower_divisors + upper_divisors[::-1]

p,q = map(int,input().split())
# (pn-q)(pm-q) = q^2
# AND pn-q > 0, pm-q > 0

x = makediv(q)
s = set()
g = []

for i in x:
	for j in x:
		if i*j not in s:
			g.append(i*j)
			s.add(i*j)

ans = []
for l in g:
	r = q * q // l
	if q + l > 0 and q + r > 0 and (q + l) % p == 0 and (q + r) % p == 0:
		ans.append(((q+l)//p, (q+r)//p))
	if q - l > 0 and q - r > 0 and (q - l) % p == 0 and (q - r) % p == 0:
		ans.append(((q-l)//p, (q-r)//p))

ans.sort()
print(len(ans))
for i in ans:
	print(i[0], i[1])