埃及分数

#include<stdio.h>
#include<string.h>
const int N = 1000;
int maxd;
int ans[N];
int v[N];
int get_first(int a, int b)
{
	int k = b/a;
	return k*a >= b ? k : k+1;
} 
int gcd(int a, int b)
{
	return b==0? a : gcd(b, a%b);
}
bool better(int d)
{
	for(int i = d; i >= 0; --i)
	{
		if(ans[i] != v[i])
		{
			return ans[i] == -1 || v[i] < ans[i];
		}
	}
	return false;
}  
bool dfs(int cur, int from, int aa, int bb)
{
	if(cur == maxd)
	{
		if(bb%aa == 0)
		{
			v[cur] = bb/aa;
			if(better(cur))
			{
				memcpy(ans, v, sizeof(ans));
				return true;
			}
		}
		return false;
	}
	bool res = false;
	for(int i = from; true; ++i)
	{
		if((maxd+1-cur)*bb <= aa*i)
			break;
		v[cur] = i;
		int a = aa*i-bb;
		int b = bb*i;
		int g = gcd(a,b);
		a /= g;
		b /= g;
		int f = get_first(a,b) > i+1 ? get_first(a,b) : i+1;
		if(dfs(cur+1, f, a, b))
		{
			res = true;
		}
	}
	return res;

}
int main()
{
	//
	freopen("input.txt", "r", stdin);
	int a, b;
	while(scanf("%d%d", &a, &b) == 2)
	{
		bool res = false;
		if(a+b == 0)
			break;

		for(maxd = 1; !res; ++maxd)
		{
			memset(ans, -1, sizeof(ans));
			res = dfs(0, get_first(a, b), a, b);
		}
		maxd--;
		for(int i=0; i <= maxd; ++i)
		{
			printf("%d ", ans[i]);
		}
		putchar('\n');
	}
}