#include <stdio.h>

long long gcd(long long a, long long b)
{
	if (a == 0) return b;
	else return gcd(b % a, a);
}

typedef struct {
	long long key, id;
} data;

void merge_sort(int n, data x[])
{
	static data y[1001] = {};
	if (n <= 1) return;
	merge_sort(n / 2, &(x[0]));
	merge_sort((n + 1) / 2, &(x[n/2]));
	
	int i, p, q;
	for (i = 0, p = 0, q = n / 2; i < n; i++) {
		if (p >= n / 2) y[i] = x[q++];
		else if (q >= n) y[i] = x[p++];
		else y[i] = (x[p].key < x[q].key)? x[p++]: x[q++];
	}
	for (i = 0; i < n; i++) x[i] = y[i];
}

int main()
{
	long long P, Q;
	scanf("%lld %lld", &P, &Q);
	
	long long g = gcd(P, Q);
	P /= g;
	Q /= g;
	
	int i, k = 0;
	long long N, M;
	data d[1001];
	for (N = (Q + P) / P; P * N <= Q * 2; N++) {
		if (N < 1) continue;
		M = Q * N / (N * P - Q);
		if (Q * (N + M) == N * M * P) {
			d[k].key = N;
			d[k++].id = M;
			if (N < M) {
				d[k].key = M;
				d[k++].id = N;
			}
		}
	}
	
	printf("%d\n", k);
	merge_sort(k, d);
	for (i = 0; i < k; i++) printf("%lld %lld\n", d[i].key, d[i].id);
	fflush(stdout);
	return 0;
}