#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
map<bool,int>m1;
int main()
{
	m1.clear();
	int m,n;
	while(cin>>n>>m)
	{
		int maxn=-1,minn=2147483647;
		int a[n],b[m];
		for(int i=0;i<n;i++)
		{
			cin>>a[i];
			m1[a[i]]=1;
			maxn=max(maxn,a[i]);
			minn=min(minn,a[i]);
		}
		for(int i=0;i<m;i++)
		{
			cin>>b[i];
			m1[b[i]]=1;
			maxn=max(maxn,b[i]);
			minn=min(minn,b[i]);
		}
		for(int i=minn;i<=maxn;i++)
			if(m1[i])
				cout<<i<<' ';
		cout<<endl;
	}
	return 0;
}

题目连接