#include <iostream>
#include<algorithm>
#include<iomanip>
#include<string>
#include<stdio.h>
#include<string.h>
using namespace std;
const long long mod = 1e9 + 7;
typedef long long ll;
struct catten
{
int start, end,last;
}cat[101];
bool cmp(catten a, catten b)
{
if(a.end!=b.end)
return a.end < b.end;
return a.last < b.last;
}
int main()
{
int n, m,a[23333];
while (cin >> n >> m)
{
for (int i = 1;i <= n + m;i++)
cin >> a[i];
sort(a + 1, a + 1 + n+m);
printf("%d", a[1]);
for (int i = 2;i <= n + m;i++)
{
if (a[i] != a[i - 1])
{
printf(" %d", a[i]);
}
}cout << endl;
}
}