#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include #include using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector #define vs vector #define vc vector #define vl vector #define vb vector #define vvi vector> #define vvc vector> #define vvl vector> #define vvb vector> #define vvvi vector>> #define vvvl vector>> #define pii pair #define pil pair #define pli pair #define pll pair #define vpii vector> #define vpll vector> #define vvpii vector>> #define vvpll vector>> template void debug(T e){ cerr << e << endl; } template void debug(vector &v){ rep(i, v.size()){ cerr << v[i] << " "; } cerr << endl; } template void debug(vector> &v){ rep(i, v.size()){ rep(j, v[i].size()){ cerr << v[i][j] << " "; } cerr << endl; } } template void debug(vector> &v){ rep(i,v.size()){ cerr << v[i].first << " " << v[i].second << endl; } } template void debug(set &st){ for (auto itr = st.begin(); itr != st.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template void debug(multiset &ms){ for (auto itr = ms.begin(); itr != ms.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template void debug(map &mp){ for (auto itr = mp.begin(); itr != mp.end(); itr++){ cerr << itr->first << " " << itr->second << endl; } } void debug_out(){ cerr << endl; } template void debug_out(Head H, Tail... T){ cerr << H << " "; debug_out(T...); } int main(){ ll P, Q; cin >> P >> Q; vpll p(0); map mp1; for (ll i = 1; i * i <= Q; i++){ if (Q % i == 0){ mp1[i]++; mp1[Q / i]++; } } vl prime_q(0); for (auto itr = mp1.begin(); itr != mp1.end(); itr++){ prime_q.push_back(itr->first); } map mp2; for (ll i = 0; i < prime_q.size(); i++){ for (ll j = 0; j < prime_q.size(); j++){ mp2[prime_q[i] * prime_q[j]]++; } } for (auto itr = mp2.begin(); itr != mp2.end(); itr++){ ll x1 = itr->first; ll x2 = (Q * Q) / x1; if ((x1 + Q) % P == 0 && (x2 + Q) % P == 0){ p.push_back(pll((x1 + Q) / P, (x2 + Q) / P)); } } cout << p.size() << endl; for (int i = 0; i < p.size(); i++){ cout << p[i].first << " " << p[i].second << endl; } }