#include<stdio.h>
int main()
{
int n = 0, m = 0;
int arr1[1000] = { 0 };//存入n个整整的数组
int arr2[1000] = { 0 };//存入m个整形的数组
int arr[2000] = { 0 };//设置一个新的数组,把n+m的整形存入
scanf("%d %d", &n, &m);
for (int i = 0; i < n; i++)
{
scanf("%d", &arr1[i]);
}
for (int i = 0; i < m; i++)
{
scanf("%d", &arr2[i]);
}
int i = 0;
int j = 0;
int k = 0;
while (i < n && j < m)
{
if (arr1[i] < arr2[j])
{
arr[k] = arr1[i];
i++;
k++;
}
else if (arr1[i] >= arr2[j])
{
arr[k] = arr2[j];
k++;
j++;
}
if (i == n)
{
for (; j < m; j++)
{
arr[k] = arr2[j];
k++;
}
}
if (j == m)
{
for (; i < n; i++)
{
arr[k] = arr1[i];
k++;
}
}
}
for (int j = 0; j < n + m; j++)
printf("%d ", arr[j]);
return 0;
}