#include #pragma GCC optimize("Ofast") #define _GLIBCXX_DEBUG using namespace std; using std::cout; using std::cin; using std::endl; using ll=long long; using ld=long double; ll ILL=1167167167167167167; const int INF=2100000000; const ll mod=1e9+7; #define rep(i,a) for (int i=0;i using _pq = priority_queue, greater>; template ll LB(vector &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();} template ll UB(vector &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();} template bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;} template bool chmax(T &a,const T &b){if(a void So(vector &v) {sort(v.begin(),v.end());} template void Sore(vector &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});} void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";} void solve(); // rainy ~ 雨に打たれて ~ int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t=1; cin>>t; rep(i,t) solve(); } void solve(){ int N; cin>>N; vector p(N),q(N),ans(N,-1); rep(i,N) cin>>p[i]; rep(i,N) cin>>q[i]; vector ind(N); rep(i,N) ind[i]=i; sort(ind.begin(),ind.end(),[&](int l,int r){ return p[l]=0&&q[l]==p[a]&&p[l]<=p[a]) ans[l]=p[a],l--; l=a+1; while(l