#include <bits/stdc++.h>
#include "hieroglyphs.h"
using namespace std;
const int N=2e5+10;

int n,m;
vector<int> psa[N],psb[N];

struct BIT{
  int t[N];

  int lowbit(int x) {
    return x&-x;
  }

  void change(int pos,int val) {
    pos++;
    for(;pos<N;pos+=lowbit(pos)) t[pos]+=val;
  }

  int sum(int pos) {
    pos++;
    int res=0;
    for(;pos;pos-=lowbit(pos)) res+=t[pos];
    return res;
  }

  int query(int l,int r) {
    return sum(r)-sum(l-1);
  }
}bit;

vector<int> ucs(vector<int> A,vector<int> B) {
  n=A.size(),m=B.size();
  vector<int> res;
  for(int i=0;i<n;i++) psa[A[i]].push_back(i);
  for(int i=0;i<m;i++) psb[B[i]].push_back(i);
  int r=0;
  for(int i=0;i<n;i++) {
    if(psb[A[i]].size()==0) continue;
    else if(psb[A[i]].size()==1) {
      if(psb[A[i]][0]<r) continue;
      else r=psb[A[i]][0]+1,res.push_back(A[i]);
    }
    else {
      if(psb[A[i]][0]>=r) r=psb[A[i]][0]+1,res.push_back(A[i]);
      else if(psb[A[i]][1]>=r) r=psb[A[i]][1]+1,res.push_back(A[i]);
    }
  }
  return res;
  int cnt=0;
  for(int i=0;i<=2e5;i++) if(psa[i].size() && psb[i].size()) cnt++;
  for(int i=0;i<n;i++) {
    if(psa[A[i]].size()+psb[A[i]].size()==3) {
      if(psa[A[i]].size() && psb[A[i]].size()) {
        if(psa[A[i]].size()==1) {
          if(bit.query(psb[A[i]][0],psb[A[i]][1])) return {-1};
        }
        else {
          if(i==psa[A[i]][0]) bit.change(psb[A[i]][0],1);
          else bit.change(psb[A[i]][0],-1);
        }
      }
    }
  }
  if(res.size()!=cnt) return {-1};
  return res;
}