#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<cmath>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;
typedef pair<int,int> P;
typedef pair<int,P> PP;

const ll MOD=998244353;
const double PI=acos(-1);

ll gcd(ll x,ll y){
    return y==0?x:gcd(y,x%y);
}



int main(){
    ll P,Q;
    cin>>P>>Q;

    ll g=gcd(P,Q);
    P/=g;
    Q/=g;

    vector<ll> div;

    for(ll i=1;i*i<=Q;i++){
        if(Q%i==0){
            div.push_back(i);

            if(Q/i!=i){
                div.push_back(Q/i);
            }
        }
    }


    set<pair<ll,ll>> cand;

    for(ll d1: div){
        for(ll d2:div){
            //d1=N', d2=M'に該当

            if((Q/d2)%d1==0 && (d1+d2)%P==0){

                ll mul=Q/(d1*d2);

                mul*=(d1+d2)/P;

                //ans[0].push_back(mul*d1);
                //ans[1].push_back(mul*d2);
                cand.emplace(mul*d1,mul*d2);


            }
        }
    }


    if(cand.size()==0){
        cout<<0<<endl;
        return 0;
    }

     cout<<cand.size()<<endl;
     for(auto [m,n]:cand){
        cout<<m<<' '<<n<<endl;
     }

    /*
    vector<pair<ll,ll>> ans;
    for(auto [m,n]:cand){
            ans.emplace_back(m,n);
        if(m!=n){
            ans.emplace_back(n,m);
        }
    }

    cout<<ans.size()<<endl;
     for(auto [m,n]:ans){
        cout<<m<<' '<<n<<endl;
     }
     */

}