#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;

    set<pair<ll,ll>> cand;
   
    for(ll c=1;c*c<=Q;c++){
        if(Q*Q%c==0){
            {
                ll d1=Q*Q/c;
                ll d2=c;

                if((d1+Q)%P==0 && (d2+Q)%P==0){
                    
                    ll n=(d1+Q)/P;
                    ll m=(d2+Q)/P;

                    //cand.emplace_back(n,m);
                    cand.insert(make_pair(n,m));
                }


            }

           

        }
    }
    
    
    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;
     }

    
}