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

def divisors2(n):
  # n^2 の約数列挙
  s=set()
  d=divisors(n)
  for i in d:
    for j in d:
      if n*n%(i*j)==0:
        s.add(i*j)
  s=sorted(list(s))
  return s


def solve(p,q):
  #(pa-q)*(pb-q)=q^2 を解く
  ans=[]
  check=set()
  for i in divisors2(q):
    j=q**2//i
    if (i+q)%p==0:
      if (i+q)//p not in check:
        ans.append([(i+q)//p,(j+q)//p])
        check.add((i+q)//p)
  print(len(ans))
  for i in ans:
    print(*i)

import math
p,q=map(int,input().split())
solve(p//math.gcd(p,q),q//math.gcd(p,q))