#include using namespace std; //#pragma GCC optimize("Ofast") #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<> #define rev(x) reverse(x); using ll=long long; using vl=vector; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[9]={1,0,-1,0,1,1,-1,-1,0}; const ll dx[9]={0,1,0,-1,1,-1,1,-1,0}; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } vector divisor(long long n) { vector ret; for (long long i = 1; i * i <= n; i++) { if (n % i == 0) { ret.push_back(i); if (i * i != n) ret.push_back(n / i); } } sort(ret.begin(), ret.end()); // 昇順に並べる return ret; } int main(){ ll p,q;cin >> p >> q; ll f=gcd(p,q);p/=f;q/=f; if(p==2&&q==1){ cout << 1 << endl; cout << 1 <<" " << 1 << endl; return 0; } if(p==1&&q==1){ cout << 1 << endl; cout << 2 <<" " << 2 << endl; } set st; for(auto g:divisor(q)){ ll m=q/g; for(auto a:divisor(m)){ if(a+(m/a)==p){ st.insert({a*g,m/a*g}); } } } cout << st.size() << endl; for(auto p:st)cout << p.first <<" " << p.second << endl; }