#include "hieroglyphs.h"

#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=2e5+5,M=(1<<28)+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,m,A[N],B[N];
int al[N],ar[N],bl[N],br[N];
vector<int> ucs(vector<int> a,vector<int> b) {
	n=a.size();m=b.size();
	for(int i=1;i<=n;i++) A[i]=a[i-1];
	for(int i=1;i<=m;i++) B[i]=b[i-1];
	Me(al,0x3f);Me(ar,-0x3f);Me(bl,0x3f);Me(br,-0x3f);
	for(int i=1;i<=n;i++) ar[A[i]]=i;
	for(int i=n;i;i--) al[A[i]]=i;
	for(int i=1;i<=m;i++) br[B[i]]=i;
	for(int i=m;i;i--) bl[B[i]]=i;
	vector<int> pos;
	for(int i=0;i<=200000;i++) if(al[i]<=ar[i]&&bl[i]<=br[i]) pos.push_back(i);
	int flag=0;
	auto cmp=[&](int x,int y){
		if(ar[x]<al[y]) return true;
		if(ar[y]<al[x]) return false;
		if(br[x]<bl[y]) return true;
		if(br[y]<bl[x]) return false;
		flag=1;return x<y;
	};
	sort(all(pos),cmp);
	for(int i=1;i<pos.size();i++){
		int x=pos[i-1],y=pos[i];
		if(ar[x]<al[y]&&br[y]<bl[x]) flag=1;
		if(br[x]<bl[y]&&ar[y]<al[x]) flag=1;
		cmp(x,y);
	} 
	for(int i=0;i<pos.size();i++) for(int j=i+1;j<pos.size();j++) assert(cmp(pos[i],pos[j]));
	if(flag) return {-1};
	return pos;

}