/*

     PROB:milk3

     ID:wanghan

     LANG:C++

 */

 #include "iostream"

 #include "cstdio"

 #include "cstring"

 #include "string"

 #include "vector"

 using namespace std;

 const int maxn=;

 int vis[maxn][maxn][maxn];

 int s[maxn];

 int A,B,C;

 void dfs(int i,int j,int k){

     if(vis[i][j][k])  return;

     if(i>A||j>B||k>C)  return;

     if(i==){

         s[k]=;

     }

     vis[i][j][k]=;

     if(k>=A-i)   //C->A

         dfs(A,j,k-(A-i));

     else

         dfs(i+k,j,);

     if(k>=B-j)   //C->B

         dfs(i,B,k-(B-j));

     else

         dfs(i,j+k,);

     if(i>=C-k)   //A->C

         dfs(i-(C-k),j,C);

     else

         dfs(,j,k+i);

     if(j>=C-k)  //B->C

         dfs(i,j-(C-k),C);

     else

         dfs(i,,j+k);

     if(i>=B-j)  //A->B

         dfs(i-(B-j),B,k);

     else

         dfs(,i+j,k);

     if(j>=A-i)  //B->A

         dfs(A,j-(A-i),k);

     else

         dfs(i+j,,k);

 }

 int main()

 {

     freopen("milk3.in","r",stdin);

     freopen("milk3.out","w",stdout);

     cin>>A>>B>>C;

     memset(vis,,sizeof(vis));

     memset(s,,sizeof(s));

     dfs(,,C);

     vector<int> h;

     for(int i=;i<=C;i++)

         if(s[i])

             h.push_back(i);

     for(int i=;i<h.size();i++){

         if(i==h.size()-)

             cout<<h[i]<<endl;

         else

             cout<<h[i]<<" ";

     }

     return ;

 }