#include <fstream>
#include <algorithm>

using namespace std;
ofstream out("out.out");

void citire( int v[], int &nr, char s[30]){

 ifstream f(s);
 int i;
 f>>nr;
 for(int i=0;i<=nr-1;i++)
    f>>v[i];
 f.close();

    }


    int afisare(int v[],int nr){
     for(int i=0;i<nr;i++)
        out<<v[i]<<" ";
        out<<endl;
    }
    void sortare(int v[], int nr){
    sort(v,v+nr);}
   void Interclasare(int a[], int b[], int c[],int &k, int m ,int n){
  int i=0;
  int  j=0;
   k=0;
   while(i<=m-1 && j<=n-1)
    if(a[i]<b[j])
    {
        c[k]=a[i];
        i++;
        k++;
    }
    else
    c[k++]=b[j++];
    while(i<=m-1)
        c[k++]=a[i++];
    while(j<=n-1)
        c[k++]=b[j++];

   }


int main()
{
    int a[1001],b[1001],c[2002],m,n,k;
    citire(a,m,"1.in");
    citire(b,n,"2.in");
    afisare(a,m);
    afisare(b,n);
    sortare(a,m);
    sortare(b,n);
    afisare(a,m);
    afisare(b,n);
    Interclasare(a,b,c,k,m,n);
    afisare(c,k);

  return 0;
}