def Prime_Factorization(N):
    if N==0:
        return [[0,1]]

    if N<0:
        R=[[-1,1]]
    else:
        R=[]

    N=abs(N)

    if N&1==0:
        C=0
        while N&1==0:
            N>>=1
            C+=1
        R.append([2,C])

    if N%3==0:
        C=0
        while N%3==0:
            N//=3
            C+=1
        R.append([3,C])

    k=5
    Flag=0
    while k*k<=N:
        if N%k==0:
            C=0
            while N%k==0:
                C+=1
                N//=k
            R.append([k,C])
        k+=2+2*Flag
        Flag^=1

    if N!=1:
        R.append([N,1])

    return R

#素因数分解の結果から, 約数を全て求める.
def Divisors_from_Prime_Factor(P,sorting=False):
    X=[1]
    for p,e in P:
        q=1
        n=len(X)
        for _ in range(e):
            q*=p
            for j in range(n):
                X.append(X[j]*q)

    if sorting:
        X.sort()

    return X

def solve():
    import sys
    input=sys.stdin.readline
    write=sys.stdout.write

    P,Q=map(int,input().split())

    E=[(p,2*e) for p,e in Prime_Factorization(Q)]
    Ans=[((Q+a)//P, (Q+Q*Q//a)//P) for a in Divisors_from_Prime_Factor(E,True) if (Q+a)%P==0 and (Q+Q*Q//a)%P==0]

    print(len(Ans))
    string=lambda x:" ".join(map(str,x))
    write("\n".join(map(string,Ans)))

#==================================================
solve()