//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
vector<int> ucs(vector<int> A,vector<int> B)
{
	int la=sz(A);
	int lb=sz(B);
	const int m=2e5+10;
	vector<int> ca(m),cb(m);
	for(auto x:A) ca[x]++;
	for(auto x:B) cb[x]++;
	vector<int> major(m);
	for(int i=0;i<m;i++)
		major[i]=ca[i]>=cb[i];
	vector<int> sa,sb;
	for(int i=0;i<la;i++)
		if(!major[A[i]])
			sa.pb(i);
	for(int i=0;i<lb;i++)
		if(major[B[i]])
			sb.pb(i);
	int p1=0,p2=0;
	vector<int> U;
	vector<vector<int>> posa(m),posb(m);
	for(int i=0;i<la;i++)
		posa[A[i]].pb(i);
	for(int i=0;i<lb;i++)
		posb[B[i]].pb(i);
	int cura=0,curb=0;
	while(p1<sz(sa)&&p2<sz(sb))
	{
		int u=sa[p1];
		int v=sb[p2];
		int q1=lb(posa[B[v]],cura);
		int q2=lb(posb[A[u]],curb);
		if(q1==sz(posa[B[v]])||q2==sz(posb[A[u]])) return {-1};
		int u2=posa[B[v]][q1];
		int v2=posb[A[u]][q2];
		if(u2>u&&v2>v) return {-1};
		if(u2>u)
		{
			U.pb(A[u]);
			p1++;
			cura=u+1;
			curb=posb[A[u]][q2]+1;
		}
		else if(v2>v)
		{
			U.pb(B[v]);
			p2++;
			curb=v+1;
			cura=posa[B[v]][q1]+1;
		}
		else
		{
			int qa=lb(posa[B[v]],u);
			int cnta=sz(posa[B[v]])-qa;
			int qb=lb(posb[B[v]],v);
			int cntb=sz(posb[B[v]])-qb;
			if(cnta>=cntb)
			{
				U.pb(A[u]);
				p1++;
				cura=u+1;
				curb=posb[A[u]][q2]+1;
			}
			else
			{
				U.pb(B[v]);
				p2++;
				curb=v+1;
				cura=posa[B[v]][q1]+1;
			}
		}
	}
	while(p1<sz(sa)) U.pb(A[sa[p1++]]);
	while(p2<sz(sb)) U.pb(B[sb[p2++]]);
	auto match=[&](const vector<int> &v1,const vector<int> &v2)
	{
		int p=0;
		for(auto x:v2)
		{
			while(p<sz(v1)&&v1[p]!=x) p++;
			if(p==sz(v1)) return false;
			p++;
		}
		return true;
	};
	if(!match(A,U)||!match(B,U)) return {-1};
	vector<int> correspond;
	vector<int> cca(m),ccb(m);
	vector<int> f(sz(U),inf),g(sz(U),inf);
	for(int i=0;i<sz(U);i++)
	{
		int x=U[i];
		if(major[x])
		{
			if(!ccb[x])
			{
				f[i]=posa[x][0]+1;
				g[i]=posb[x][0]+1;
			}
			correspond.pb(posb[x][ccb[x]++]);
		}
		else
		{
			if(!cca[x])
			{
				f[i]=posa[x][0]+1;
				g[i]=posb[x][0]+1;
			}
			correspond.pb(posa[x][cca[x]++]);
		}
	}
	vector<int> st[2];
	vector<int> app(m,-1);
	auto getval=[&](int pos,int x)
	{
		assert(lb(st[x],pos)!=sz(st[x]));
		int ap=st[x][lb(st[x],pos)];
		return mp(f[ap],g[ap]);
	};
	for(int i=0;i<sz(U);i++)
	{
		int lst=app[U[i]];
		app[U[i]]=i;
		if(i&&sz(st[0])&&max(0,lst)<=st[0].back())
		{
			auto state=getval(max(0,lst),0);
			int fv=state.first;
			int gv=state.second;
			if(major[U[i]])
			{
				if(~lst&&gv<=correspond[lst]&&lb(posa[U[i]],fv)!=sz(posa[U[i]])) return {-1};
				if(gv<=correspond[i]&&lb(posa[U[i]],fv)!=sz(posa[U[i]]))
				{
					f[i]=min(f[i],posa[U[i]][lb(posa[U[i]],fv)]+1);
					g[i]=correspond[i]+1;
				}
			}
			else
			{
				if(~lst&&fv<=correspond[lst]&&lb(posb[U[i]],gv)!=sz(posb[U[i]])) return {-1};
				if(fv<=correspond[i]&&lb(posb[U[i]],gv)!=sz(posb[U[i]]))
				{
					f[i]=correspond[i]+1;
					g[i]=min(g[i],posb[U[i]][lb(posb[U[i]],gv)]+1);
				}
			}
		}
		if(i&&sz(st[1])&&max(0,lst)<=st[1].back())
		{
			auto state=getval(max(0,lst),1);
			int fv=state.first;
			int gv=state.second;
			if(major[U[i]])
			{
				if(~lst&&gv<=correspond[lst]&&lb(posa[U[i]],fv)!=sz(posa[U[i]])) return {-1};
				if(gv<=correspond[i]&&lb(posa[U[i]],fv)!=sz(posa[U[i]]))
				{
					f[i]=min(f[i],posa[U[i]][lb(posa[U[i]],fv)]+1);
					g[i]=correspond[i]+1;
				}
			}
			else
			{
				if(~lst&&fv<=correspond[lst]&&lb(posb[U[i]],gv)!=sz(posb[U[i]])) return {-1};
				if(fv<=correspond[i]&&lb(posb[U[i]],gv)!=sz(posb[U[i]]))
				{
					f[i]=correspond[i]+1;
					g[i]=min(g[i],posb[U[i]][lb(posb[U[i]],gv)]+1);
				}
			}
		}
		while(sz(st[major[U[i]]])&&(f[st[major[U[i]]].back()]>f[i]||g[st[major[U[i]]].back()]>g[i]))
			st[major[U[i]]].pop_back();
		st[major[U[i]]].pb(i);
	}
	vector<int> uc(m);
	for(auto x:U) uc[x]++;
	for(int i=0;i<sz(U);i++)
	{
		uc[U[i]]--;
		if(!uc[U[i]])
		{
			if(sz(st[0])&&i<=st[0].back())
			{
				auto state=getval(i,0);
				int fv=state.first;
				int gv=state.second;
				if(fv<=posa[U[i]].back()&&gv<=posb[U[i]].back()) return {-1};
			}
			if(sz(st[1])&&i<=st[1].back())
			{
				auto state=getval(i,1);
				int fv=state.first;
				int gv=state.second;
				if(fv<=posa[U[i]].back()&&gv<=posb[U[i]].back()) return {-1};
			}
		}
	}
	return U;
}
#ifndef ONLINE_JUDGE
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n,m;
	cin>>n>>m;
	vector<int> A(n),B(m);
	for(auto &x:A) cin>>x;
	for(auto &x:B) cin>>x;
	A=ucs(A,B);
	for(auto x:A) cout<<x<<" ";
	return 0;
}
#endif