#include<stdio.h>
const int INF=0xfffffff;
int key,ans[10];
void insert_sort(int *A,int n,int key)
{
if(n==0||key<=A[n-1]){A[n]=key;return ;}
int i=n;
while(i>0&&key>A[i-1]){A[i]=A[i-1];i--;}
A[i]=key;
}
int main()
{
for(int i=0;i<10;i++)ans[i]=-INF;
int n=0;
for(int i=1;i<=12;i++)
{
scanf("%d",&key);
if(n<9)
{
insert_sort(ans,n,key);
n+=1;
}
else if(key>ans[n])
{
insert_sort(ans,n,key);
}
}
for(int i=0;i<=n;i++)printf("%d ",ans[i]);
printf("\n");
return 0;
}
const int INF=0xfffffff;
int key,ans[10];
void insert_sort(int *A,int n,int key)
{
if(n==0||key<=A[n-1]){A[n]=key;return ;}
int i=n;
while(i>0&&key>A[i-1]){A[i]=A[i-1];i--;}
A[i]=key;
}
int main()
{
for(int i=0;i<10;i++)ans[i]=-INF;
int n=0;
for(int i=1;i<=12;i++)
{
scanf("%d",&key);
if(n<9)
{
insert_sort(ans,n,key);
n+=1;
}
else if(key>ans[n])
{
insert_sort(ans,n,key);
}
}
for(int i=0;i<=n;i++)printf("%d ",ans[i]);
printf("\n");
return 0;
}