#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

template<class T>
vector<T> divisors(T x) {
  vector<T> res1, res2;
  T d = 1;
  for(; d * d < x; d++) {
    if (x % d == 0) {
      res1.emplace_back(d);
      res2.emplace_back(x / d);
    }
  }
  if (d * d == x) res1.emplace_back(d);
  res1.insert(res1.end(), res2.rbegin(), res2.rend());
  return res1;
}

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int p, q;
  cin >> p >> q;
  auto ds = divisors(q);
  int sz = ds.size();
  vector<pair<ll, ll>> ans;
  rep(i, sz) rep(j, sz) {
    int n = ds[i], m = ds[j];
    if (gcd(n, m) != 1) continue;
    ll x = (ll)n * m;
    if (q % x) continue;
    int c = q / x;
    ll gp = (ll)c * (n + m);
    if (gp % p) continue;
    ll g = gp / p;
    ans.emplace_back(g * n, g * m);
  }
  sort(all(ans));
  cout << ans.size() << '\n';
  for(auto [n, m]: ans) {
    cout << n << ' ' << m << '\n';
  }
}