#include<iostream>
#include<algorithm>
#include<math.h>
#include<cstdio>
#include<cstring>
#include<stack>
#include<string>
using namespace std;
typedef int list[100];
void getelem(list l,int i,int &x)
{
x=l[i];
return ;
}
void listinsert(list l,int k,int x)
{
l[k]=x;
return ;
}
void mergelist(list la,list lb,list lc)
{
int i,j;
i=j=0;
int k=0;
int ai,bj;
while(i<4&&j<7)
{
getelem(la,i,ai);
getelem(lb,j,bj);
if(ai<=bj)
{
listinsert(lc,k++,ai);
++i;
}
else
{
listinsert(lc,k++,bj);++j;
}
while(i<4)
{
getelem(la,i++,ai);
listinsert(lc,k++,ai);
}
while(j<7)
{
getelem(lb,j++,bj);
listinsert(lc,k++,bj);
}
}
}
int main()
{
list la;
list lb;
list lc;
for(int i=0;i<4;i++)
cin>>la[i];
for(int j=0;j<7;j++)
cin>>lb[j];
mergelist(la,lb,lc);
for(int k=0;k<11;k++)
cout<<lc[k]<<" ";
cout<<endl;
return 0;
}