#include <bits/stdc++.h>
using namespace std;
int main(){
  int P, Q;
  cin >> P >> Q;
  int Q2 = Q;
  long long X = (long long) Q * Q;
  vector<pair<long long, int>> F1;
  for (int i = 2; i * i <= Q2; i++){
    if (Q2 % i == 0){
      int cnt = 0;
      while (Q2 % i == 0){
        cnt++;
        Q2 /= i;
      }
      F1.push_back(make_pair(i, cnt * 2));
    }
  }
  if (Q2 > 1){
    F1.push_back(make_pair(Q2, 2));
  }
  int cnt = F1.size();
  vector<long long> F = {1};
  for (int i = 0; i < cnt; i++){
    int sz = F.size();
    vector<long long> F2;
    for (int j = 0; j < sz; j++){
      long long x = F[j];
      for (int k = 0; k <= F1[i].second; k++){
        F2.push_back(x);
        if (k < F1[i].second){
          x *= F1[i].first;
        }
      }
    }
    F = F2;
  }
  sort(F.begin(), F.end());
  int cnt2 = F.size();
  vector<pair<long long, long long>> ans;
  for (int i = 0; i < cnt2; i++){
    long long x = F[i],  y = X / F[i];
    if ((x + Q) % P == 0 && (y + Q) % P == 0){
      long long N = (x + Q) / P;
      long long M = (y + Q) / P;
      ans.push_back(make_pair(N, M));
    }
  }
  int T = ans.size();
  cout << T << endl;
  for (int i = 0; i < T; i++){
    cout << ans[i].first << ' ' << ans[i].second << endl;
  }
}