#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

ll P,Q;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>P>>Q;
	vector<ll> R;
	for(i=1;i*i<=Q;i++) if(Q%i==0) {
		R.push_back(i);
		R.push_back(Q/i);
	}
	vector<ll> S;
	FORR(a,R) FORR(b,R) if(Q*Q%(a*b)==0) S.push_back(a*b);
	sort(ALL(S));
	S.erase(unique(ALL(S)),S.end());
	
	vector<pair<ll,ll>> ret;
	FORR(a,S) {
		if((a+Q)%P==0&&(Q*Q/a+Q)%P==0) {
			ret.push_back({(a+Q)/P,(Q*Q/a+Q)/P});
		}
	}
	
	
	cout<<ret.size()<<endl;
	FORR2(a,b,ret) cout<<a<<" "<<b<<endl;
		
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}