#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    ll P,Q;cin>>P>>Q;
    vll ans;
    
    auto solve=[&](ll a,ll b){
        if((Q+a)%P==0&&(Q+b)%P==0){
            ans.pb(mp((Q+a)/P,(Q+b)/P));
        }
    };
    vl yaku,yaku1;
    for(ll s=1;s*s<=Q;s++){
        if(Q%s==0){
            yaku1.pb(s);
            yaku1.pb(Q/s);
        }
    }
    for(ll a:yaku1){
        for(ll b:yaku1){
            yaku.pb(a*b);
        }
    }
    mkunique(yaku);
    for(ll s:yaku){
        solve(s,Q*Q/s);
    }
    sort(all(ans));
    cout<<si(ans)<<"\n";
    for(auto [a,b]:ans) cout<<a<<" "<<b<<"\n";
}