#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vvvvll = vector<vvvll>;
using vvvvvll = vector<vvvvll>;
using vvvvvvll = vector<vvvvvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vvvvb = vector<vvvb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
using vvvvd = vector<vvvd>;
using vvvvvd = vector<vvvvd>;
#define all(A) A.begin(),A.end()
#define ALL(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
using pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;


template<class T>
bool chmax(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

template<class T>
bool chmin(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

ll gcd(ll(a), ll(b)) {
    if (b == 0)return a;
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}
ll sqrtz(ll N) {
    ll L = 0;
    ll R = sqrt(N) + 10000;
    while (abs(R - L) > 1) {
        ll mid = (R + L) / 2;
        if (mid * mid <= N)L = mid;
        else R = mid;
    }
    return L;

}
using mint = modint1000000007;
vector<mint> fact, factinv, inv;
const ll mod = 1000000007;
void prenCkModp(ll n) {
    fact.resize(n + 5);
    factinv.resize(n + 5);
    inv.resize(n + 5);
    fact[0] = fact[1] = 1;
    factinv[0] = factinv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < n + 5; i++) {
        fact[i] = (fact[i - 1] * i);
        inv[i] = (mod - (inv[mod % i] * (mod / i)));
        factinv[i] = (factinv[i - 1] * inv[i]);
    }

}

mint nCk(ll n, ll k) {
    if (n < k || k < 0) return 0;
    return (fact[n] * ((factinv[k] * factinv[n - k])));
}
;
template <int char_size, int base>
struct Trie {
    struct Node {
        vector<int> next;
        vector<int> accept;
        int c;
        int common;
        int depth;
        Node(int c_) : c(c_), common(0) {
            next.assign(char_size, -1);
            depth = 0;
        }
    };

    vector<Node> nodes;
    int root;
    Trie() : root(0) {
        nodes.push_back(Node(root));
    }

    void insert(const string& word, int word_id) {
        int node_id = 0;
        for (int i = 0; i < (int)word.size(); i++) {
            int c = (int)(word[i] - base);
            int& next_id = nodes[node_id].next[c];
            if (next_id == -1) {
                next_id = (int)nodes.size();
                nodes.push_back(Node(c));
                nodes.back().depth = nodes[node_id].depth + 1;
            }
            ++nodes[node_id].common;
            node_id = next_id;
        }
        ++nodes[node_id].common;
        nodes[node_id].accept.push_back(word_id);
    }

    void insert(const string& word) {
        insert(word, nodes[0].common);
    }


    bool search(const string& word, bool prefix = false) {
        int node_id = 0;
        for (int i = 0; i < (int)word.size(); i++) {
            int c = (int)(word[i] - base);
            int& next_id = nodes[node_id].next[c];
            if (next_id == -1) {
                return false;
            }
            node_id = next_id;
        }
        return (prefix) ? true : nodes[node_id].accept.size() > 0;
    }

    bool start_with(const string& prefix) {
        return search(prefix, true);
    }

    int count() const {
        return (nodes[0].common);
    }

    int size() const {
        return ((int)nodes.size());
    }
};

int main() {
    ll P,Q;
    cin>>P>>Q;
    set<pair<ll,ll>> AN;
    for(ll i=1;i*i<=Q;i++){
        if(Q%i==0){
            ll x=i+Q;
            ll y=Q+(Q*Q/i);
            if(x%P==0&&y%P==0){
                AN.insert({x/P,y/P});
                AN.insert({y/P,x/P});
            }
            x=(Q/i)+Q;
            y=Q+(Q*Q/(Q/i));
            if(x%P==0&&y%P==0){
                AN.insert({x/P,y/P});
                AN.insert({y/P,x/P});
            }
        }
    }
    cout<<AN.size()<<endl;
    for(auto p:AN)cout<<p.first<<" "<<p.second<<endl;
}