usaco milk3

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
int a,b,c,ans[500],n;
short may[30][30][30];
int find(int a1,int b1,int c1){
	if(may[a1][b1][c1]) return 0;
	if(a1+b1+c1!= c)
	  return 1;
	if(a1==0){
		ans[++n] = c1;
	}
	may[a1][b1][c1] = 1;
	if(c1>=a-a1)
		find(a,b1,c1-a+a1);
	else find(a1+c1,b1,0); 
	if(c1>=b-b1)
		find(a1,b,c1-b+b1);
	else find(a1,b1+c1,0);
	if(a1>=b-b1)
		find(a1-b+b1,b,c1);
	else find(0,a1+b1,c1);
	find(0,b1,c1+a1);
	if(b1>a-a1)
		find(a,b1-a+a1,c1);
	else find(a1+b1,0,c1);
	find(a1,0,c1+b1);
	return 0;
}
int main(){
	freopen("milk3.in","r",stdin);
	freopen("milk3.out","w",stdout);
	scanf("%d%d%d",&a,&b,&c);
	int i,j,maxj,temp;
	find(0,0,c);
	for(i = 1;i<=n;i++){
		maxj= i;
		for(j=i+1;j<=n;j++){
			if(ans[j]<ans[maxj]) maxj = j;
		}
		temp=ans[maxj];
		ans[maxj]=ans[i]; 
		ans[i]=temp;
	}
	for(i=1;i<n;i++)
		printf("%d ",ans[i]);
	printf("%d\n",ans[n]);
	return 0;
}