import java.math.BigInteger;
import java.util.Scanner;


public class egypt {
	public static void main(String[] args)
	{
		Scanner in = new Scanner(System.in);
		int num,denom;
		while(true)
		{
			num = in.nextInt();
			if (num == 0) break;
			denom = in.nextInt();
			for(int i=2;i<1000000&&num>1;i++)
			{
				if(num*i<denom)
					continue;
				BigInteger newdenom = BigInteger.valueOf(denom);
				newdenom = newdenom.multiply(BigInteger.valueOf(i)).divide(newdenom.gcd(BigInteger.valueOf(i)));
				BigInteger newnum = newdenom.divide(BigInteger.valueOf(denom)).multiply(BigInteger.valueOf(num)).subtract(newdenom.divide(BigInteger.valueOf(i)));
				BigInteger gcd = newnum.gcd(newdenom);
				newnum = newnum.divide(gcd);
				newdenom = newdenom.divide(gcd);
				if(newdenom.compareTo(BigInteger.valueOf(1000000))>0)
					continue;
				System.out.print(i+" ");
				i--;
				num = newnum.intValue();
				denom = newdenom.intValue();
			}
			System.out.println(denom);
		}
	}
}