蒟蒻内心崩溃啊啊啊啊啊

/*
ID:shang_w1
LANG:C++
TASK:Mother's Milk
*/
#include<bits/stdc++.h>
using namespace std;
int top;
int ans[6666];
int a,b,c,A,B,C;
int ha[21][21][21];
void search(int a,int b,int c)
{
	if(ha[a][b][c])
		return;
    if(a==0)
		ans[++top]=c;
    ha[a][b][c]=1;
	if(a<A)
	{
		if(c)
			search(min(A,a+c),b,c-min(A,a+c)+a);
		if(b)
			search(min(A,a+b),b-min(A,a+c)+a,c);
	}
	if(b<B)
	{
		if(c)
			search(a,min(b+c,B),c-(min(B,b+c)-b));
		if(a)
			search(a-(min(B,a+b)-b),min(B,a+b),c);
	}
	if(c<C)
	{
		if(a)
			search(a-(min(C,a+c)-c),b,min(C,c+a));
		if(b)
			search(a,b-(min(C,c+b)-c),min(C,c+b));
	}
}
int main()
{
//	freopen("milk3in","r",stdin);
//	freopen("milk3.out","w",stdout);
	cin>>A>>B>>C;
	search(0,0,C);
	sort(ans+1,ans+top+1);
	for(int i=1;i<=top;i++)
		printf("%d ",ans[i]);
	return 0;
}