#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

ll p,q;

vector<ll>f(int n,vector<pair<ll,int>>&pr){
    if(n==pr.size())return{1};
    vector<ll>V=f(n+1,pr),re;
    auto[x,c]=pr[n];
    ll z=1;
    rep(j,c+1){
        for(auto y:V){
            re.push_back(y*z);
        }
        z*=x;
    }
    return re;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>p>>q;
    ll r=q;
    vector<pair<ll,ll>>ans;
    ll x=2;
    vector<pair<ll,int>>pr;
    while(x*x<=q){
        int cnt=0;
        while(q%x==0){
            cnt++;
            q/=x;
        }
        if(cnt>0)pr.push_back(make_pair(x,2*cnt));
        x++;
    }
    if(q>1)pr.push_back(make_pair(q,2));
    vector<ll>V=f(0,pr);
    for(auto y:V){
        if((y+r)%p==0&&(r*r/y+r)%p==0){
            ans.push_back(make_pair((y+r)/p,(r*r/y+r)/p));
        }
    }
    cout<<ans.size()<<"\n";
    sort(all(ans));
    for(auto[n,m]:ans){
        cout<<n<<" "<<m<<"\n";
    }
}