#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

vector<ll> divs(ll n){
    vector<ll> ans;
    for(ll x = 1; x*x <= n; x++){
        if(n%x == 0){
            ans.push_back(x);
            if(x*x != n) ans.push_back(n/x);
        }
    }
    sort(ans.begin(), ans.end());
    return ans;
}

using P = pair<ll, ll>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    ll p, q; cin >> p >> q;
    ll g = gcd(p, q);
    p /= g;
    q /= g;
    auto v = divs(q);
    vector<P> ans;
    for(ll n: v){
        for(ll m: v){
            if(gcd(n, m) != 1) continue;
            ll a = q*(n+m), b = n*m;
            if(a%b != 0) continue;
            ll px = a/b;
            if(px%p != 0) continue;
            ll x = px/p;
            ans.push_back(P(n*x, m*x));
        }
    }
    sort(ans.begin(), ans.end());
    cout << ans.size() << endl;
    for(auto [n, m]: ans) cout << n << ' ' << m << endl;
}