1 2
1
2 3
1 2
1
1 2

1 2 3
1 2

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
int main(){
    int  m,n,i,count;
    while(scanf("%d%d",&n,&m)!=EOF){
        int a[10001],b[10001],k[20003];
        count=0;
        for(i=0;i<n;i++){
            cin>>a[i];
            k[count++]=a[i];
        }
        for(i=0;i<m;i++){
            cin>>b[i];
            k[count++]=b[i];
        }
        sort(k,k+count);
        for(i=0;i<count;i++){
            if(k[i]!=k[i+1]){
                printf("%d",k[i]);
            if(i+1<count)
                putchar(' ');
            }
        }
        putchar('\n');
    }
    return 0;
}