#include <bits/stdc++.h>
using namespace std;

const int N = 1e5+10;
int a[N];
int b[N];
int fa[N];
int nxt[N];
int p1[N], p2[N];
int m[N<<1];
int n;

void dfs(int l1,int r1,int l2,int r2,int f){
    if (!(1 <= l1 && l1 <= r1 && r1 <= n && 1 <= l2 && l2 <= r2 && r2 <= n)) {
        return;
    }
    if(l1==r1){
        fa[a[l1]]=f;
        return;
    }
    if (r1 - l1 == 1) {
        if (a[l1] == b[l2]) {
            fa[a[l1]] = f;
            fa[a[r1]] = a[l1];
        } else {
            fa[a[l1]] = f;
            fa[a[r1]] = f;
        }
        return;
    }
    if(a[l1]==b[l2]){ 
        fa[a[l1]]=f;
        int t = nxt[l1];
        if (t == 0 || t > r1) {
            dfs(l1+1,r1,l2+1,r2,a[l1]);
        } else {
            fa[a[t]] = f;
            dfs(l1+1,t-1,l2+1,l2 - l1 + t - 1,a[l1]);
            dfs(t+1,r1,r2 - r1 + t + 1,r2,a[t]);
        }
    }
    else{
        fa[a[l1]]=f;
        fa[b[l2]]=f;
        int t = p2[a[l1]];
        dfs(l1+1,l1+r2-t,t+1,r2,a[l1]);
        dfs(l1+r2-t+2,r1,l2+1,t-1,b[l2]);
    }
}

void solve() {
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1;i<=n;i++) cin>>b[i];
    for (int i = 1; i <= n; i++) {
        nxt[i] = 0;
    }
    for (int i = 1; i <= 2 * n; i++) {
        m[i] = 0;
    }
    for (int i = 1; i <= n; i++) {
        p1[a[i]] = i;
        p2[b[i]] = i;
    }
    for (int i = n; i >= 1; i--) {
        nxt[i] = m[i - p2[a[i]] + n];
        m[i - p2[a[i]] + n] = i;
    }
    fa[a[1]]=0;
    dfs(2,n,2,n,a[1]);
    for(int i=1;i<=n;i++){
        cout<<fa[i]<<" \n"[i == n];
    }
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t;
	cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}