#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0;i<int(n);i++)
typedef long long ll;
typedef pair<int,int> P;

vector<ll> div(ll n){
	vector<ll> d;
	for(ll i=1;i*i<=n;i++){
		if(n%i==0){
			d.push_back(i);
			if(i!=n/i) d.push_back(n/i);
		}
	}

	return d;
}

int main(void){
	ll i,j;

	cin.tie(0);  ios_base::sync_with_stdio(false);

	ll p,q;
	cin >> p >> q;

	vector<ll> a=div(q);
	vector<ll> b;
	ll s=a.size();
	for(i=0;i<s;i++){
		for(j=i;j<s;j++){
			b.push_back(a[i]*a[j]);
		}
	}

	sort(b.begin(),b.end());
	b.erase(unique(b.begin(),b.end()),b.end());
	ll t=b.size();

	vector<ll> n,m;
	ll T=0;
	for(i=0;i<t;i++){
		if((b[i]+q)%p==0 && (q*q/b[i]+q)%p==0){
			n.push_back((b[i]+q)/p);
			m.push_back((q*q/b[i]+q)/p);
			T++;
		}
	}

	cout << T << endl;
	REP(i,T){
		cout << n[i] << ' ' << m[i] << endl;
	}


	return 0;
}